deliverables/p1/p1.tex

   1 %&p1
   2 \begin{document}
   3 \frame{\titlepage}
   4
   5 %- Anything that is specific to your parser
   6 %       - Positions Pim
   7 %       - yard (parser combinators) Pim
   8 %       - Implementation language Pim
   9 %       - Elaborate diffulties and eases (Tussendoor)
  10 %   - LL* Mart
  11 %- Did you split it into two phases lexing and parsing, or just one phase? Pim
  12 %       - Why parser combinator for lexer
  13 %- Did you change the grammar, and if so how? Mart
  14 %       - Standard tricks, remove left assoc, get operator assoc correct.
  15 %       - How did you solve the problems of precedence and associativity?
  16 %- Does your parser stop after the first encountered error or can it go on? Pim
  17 %               (bij Yard erin fietsen)
  18 %       - Stops, this is design, parsing should be correct!!!1!
  19 %- For a couple of example programs, when you do a sequence of    Mart
  20 %    1. parse
  21 %    2. pretty-print
  22 %    3. parse
  23 %    4. pretty-print
  24 %       -- Dit gaan we met een shell scriptje doen
  25 %- Code metrics, loc, etc, met stomme xkcd Mart
  26 %  How many lines of code do you have, how many hours did you work on it?
  27 %       “Measuring programming progress by lines of code is like measuring
  28 %       aircraft building progress by weight.”
  29 %
  30 %       ― Bill Gates
  31 %       Hoeveel uur, ook geen idee. Ook een stomme quote
  32 %- Did you try your parser on weird inputs, like 100 megabyte of nested     Mart
  33 %parenthesis? 1 gigabyte?
  34 %       - Yes, we did, didn't work out. Uses big heap and stack
  35 %- Problems and learned things
  36 %- Demonstrate your parser and pretty-printer on two or three programs that you
  37 %       find interesting        Mart (teminaldingen kun jij goed ;))
  38 \end{document}