Top-down Parsing (ASU Ch 4.4) Predictive Parsers (ASU 4.4 ...

More documents

Recommendations

Info

Transition Diagrams: example (ASU pp183-185) • Optimisation E E+T | T T T*F | F F (E) | id + 0 T 3 ¤ 6 * F ¤ 7 8 13 14 ( 15 E 16 ) 17 id 6 14/10/2014 DFR - CC - TDP
Non Recursive Predictive Parser (NRPP) (ASU Ch 4.4, Fig 4.13) • table driven + stack – $ : end-of-input / bos – M[A, a] - A NT, a T or $ – X is symbol on tos • actions – X = a = $ : halt, success – X = a != $ : pop X, advance input pointer – X is NT : see M[X, a] stack X Y Z $ • X => UVW (expand X on stack) • X is error - call error recovery input (w) a + b $ PP program parsing table M output 7 14/10/2014 DFR - CC - TDP
Page 1 and 2: Top-down Parsing (ASU Ch 4.4) • P
Page 3 and 4: Transition Diagrams (ASU pp183-185)
Page 5: Recursive Descent example L ::= E {
Page 9 and 10: First and Follow Sets (ASU Ch 4.4)
Page 11 and 12: First and Follow Sets (ASU Ch 4.4)
Page 13 and 14: Parsing Table M (ASU Fig 4.15 p188)
Page 15 and 16: Constructing the Parsing Table: Det
Page 17 and 18: Non Recursive Parsing Algorithm (AS
Page 19 and 20: Properties of LL(1) Grammars (ASU C

Top-down Parsing (ASU Ch 4.4) Predictive Parsers (ASU 4.4 ...

Create successful ePaper yourself

Delete template?

Save as template?