• edited by
937 views
0 0 votes

Consider the following grammar :
S →(S) | ε
Consider an instant where while parsing the string “(())”
Top of stack: S
Input pointer: )

The operation performed at this point is?

  1.   S is popped off
  2.   S is kept as it is.
  3.   S is kept as it is and the input pointer is incremented
  4.   None of these.

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
248
248 views
souled asked Mar 22
248 views
ISNT THIS LL1 PARSING TABLE WRONG??SINCE first of S is {a,b} S- AB should be written is column a and b both..
1 1 vote
0 0 answers
181
181 views
ASUR asked Oct 3, 2025
181 views
For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that are need to be filled are indicated as E1, E2, and E3.A ->Bb |...
0 0 votes
2 2 answers
1.0k
1.0k views
pa-try asked Dec 5, 2017
1,007 views
Consider the grammar with non-terminal $\mathrm{N}=\left\{\mathrm{S}, \mathrm{C}, \mathrm{S}_{1}\right\}$, terminals $\mathrm{T}=\{\mathrm{a}, \mathrm{b}, \mathrm{i}, \ma...
1 1 vote
0 0 answers
902
902 views
rahul sharma 5 asked Dec 29, 2016
902 views
Why ambiguous grammer can't be LL(1)?