View source for Top-Down Parsing/Exercise 15: Test 2018/04/07

{{TOCright}}
= Problem =

Consider the following grammar, where '''Y''' is the initial symbol and '''{a,b,c,d}''' is the set of terminal symbols:

 X -> X b Y | Y a c Z | c
 Y -> Y b | b X a
 Z -> a | d

# Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language.
# Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table.
# Show the analysis table (stack, input, and actions) for the parsing process of the '''bca''' input sequence.

= Solution =

{{CollapsedCode|Solução completa|
[[image:co18-test1b-ll1.jpg]]
}}

[[category:Compiladores]]
[[category:Ensino]]