Root: Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''S''' is the initial symbol and '''{a,b,c,d}''' is the set of terminal symbols: R -> c S -> S b T | T a R..."

2018-04-23T17:36:21Z

Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''S''' is the initial symbol and '''{a,b,c,d}''' is the set of terminal symbols: R -> c S -> S b T | T a R..."

New page

{{TOCright}}
= Problem =

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

R -> c
S -> S b T | T a R U | c
T -> T b | b S a
U -> 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 '''cbbca''' input sequence.

= Solution =

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

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

Top-Down Parsing/Exercise 14: Test 2018/04/07 - Revision history

Root: Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''S''' is the initial symbol and '''{a,b,c,d}''' is the set of terminal symbols: R -> c S -> S b T | T a R..."