Introduction to Compiler Construction in a Java World

Parsing 109

• The row of entries for state 0 is derived from item set s

0

.

– By step 2a of Algorithm 3.11, the transition goto(s

0

, () = s

4

implies Action[0,

(] = s4, and goto(s

0

, id) = s

5

implies Action[0, id] = s5. The s4 means “shift

the next input symbol ( onto the stack and go into state 4”; the s5 means “shift

the next input symbol id onto the stack and go into state 5.”

• The row of entries for state 1 is derived from item set s

1

:

– By step 2a, the transition goto(s

1

, +) = s

6

implies Action[1, +] = s6. Remember,

the s6 means “shift the next input symbol + onto the stack and go into state 6”.

– By step 2b, because item set s

1

contains [E

0

::= E·, #], ...