GATE Computer Science (CS) 2012 Solved Paper
Show Para
Question Numbers: 62-63
For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. ε is the empty string, $ indicates end of input, and, | separates alternate right hand sides of productions.
S → a A b B | b A a B | ε
A → S
B → S
For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. ε is the empty string, $ indicates end of input, and, | separates alternate right hand sides of productions.
S → a A b B | b A a B | ε
A → S
B → S
|
|
a |
b |
$ |
|
S |
E1 |
E2 |
S → ε |
|
A |
A → S |
A → S |
Error |
|
B |
B → S |
B → S |
E3 |
© examsiri.com
Question : 62 of 65
Marks:
+1,
-0
The FIRST and FOLLOW sets for the non-terminals A and B are
Go to Question: