Scribd
Upload
33 views

Week 5 - Notes

The document discusses parsing expressions using a pushdown automaton (PDA). It provides examples of parsing the expressions (()) and ()() using a PDA with states q0, q1, q2, q3. It transitions between states based on consuming opening/closing parentheses and pushing/popping a stack. The document also discusses lookahead symbols and how they can help determine which production rule to use when a grammar has multiple options for a start symbol. It provides examples calculating FIRST and FOLLOW sets for grammars. And shows a sample parsing table derived from a grammar.

Uploaded by

jdster
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Week 5 - Notes

The document discusses parsing expressions using a pushdown automaton (PDA). It provides examples of parsing the expressions (()) and ()() using a PDA with states q0, q1, q2, q3. It transitions between states based on consuming opening/closing parentheses and pushing/popping a stack. The document also discusses lookahead symbols and how they can help determine which production rule to use when a grammar has multiple options for a start symbol. It provides examples calculating FIRST and FOLLOW sets for grammars. And shows a sample parsing table derived from a grammar.

Uploaded by

jdster
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Parsing (()), () () with M2

(())
l
l
l
l
l
l
l

Start in qo
Push $ on top of stack (initialisation), move to q1
Consume ( and push ( , stay in q1
Consume ( and push ( , stay in q1
Consume ) and pop (, move to q2
Consume ) and pop (, stay in q2
Pop $ from stack, move to q3

()()
l
l
l
l
l
l
l

Start in qo
Push $ on top of stack (initialisation), move to q1
Consume ( and push ( , stay in q1
Consume ) and pop ( , move to q2
Consume ( and push ( , move to q1
Consume ) and pop ( , stay in q2
Pop $ from stack, move to q3
COMP2022 sem1, 2015, Kalina Yacef

11

Lookahead symbols
Lets consider a grammar with 2 rules for the start symbol
S-> XY | YZ
(other rules of the grammar not shown)

In a derivation, which rule to choose to replace the variable S?


S=>XY or S=>YZ?
Looking ahead in the input string helps choosing the rule to use
Suppose that XY can only derive strings starting with a
And YZ can only derive strings starting with b or c
by looking ahead one symbol, we know which rule to select
eg If we need to derive abc : S=> XY
If we need to derive cab : S=> YZ

COMP2022 sem1, 2015, Kalina Yacef

24

Examples calculating FIRST sets


B (B) B |

FIRST( (B) B) = { ( }
FIRST ( B ) = FIRST( (B)B ) FIRST() ={ (, }
S BC | a
B bB |
C cC |
FIRST() = {}
FIRST(c) = {c}
FIRTST(cC) = {c}
FIRST(C) = FIRST (cC) FIRST() = {c, }
FIRST(B) = FIRST (bB) FIRST() ={b, }
FIRST(S) = FIRST(BC) FIRST(a)= {a,b,c, }
COMP2022 sem1, 2015, Kalina Yacef

35

Examples calculating FOLLOW sets


S BC | a
B bB |
C cC |
FOLLOW(S)= {$}
FOLLOW(B)= {c, $ }
FOLLOW(C)= {$}
B (B) B |
FOLLOW( B ) = { ), $ }
COMP2022 sem1, 2015, Kalina Yacef

39

Example of a Parsing Table


S BC
Sa
B bB
B
C cC
C

FIRST(BC) = {b, c, }
FIRST(a) = {a}
FIRST(bB) = {b}
FIRST() = {}
FOLLOW(B)={c,$}
FIRST(cC) = {c}
FIRST() = {}
FOLLOW(C)={$}
a

Sa

B
C
COMP2022 sem1, 2015, Kalina Yacef

S BC

S BC

S BC

B bB

C cC

42

You might also like