Register

LL1 parsing

• edited by
677 views
0 votes
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.
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
pa-try asked Dec 5, 2017
563 views
LL1 grammer
User Avatar
1 votes
1 votes
0 answers
2
rahul sharma 5 asked Dec 29, 2016
756 views
Compiler Design LL1 parser
Why ambiguous grammer can't be LL(1)?
Why ambiguous grammer can't be LL(1)?
User Avatar
0 votes
0 votes
1 answer
3
GateAspirant999 asked Dec 10, 2016
602 views
Is this grammar LL1, LR0, SLR1, LALR1, CLR1?
$S\rightarrow (x$ $\text{ }| E]$ $\text{ }| F)$ $X\rightarrow E)$ $\text{ }| F]$ $E\rightarrow A$ $F\rightarrow A$ $A\rightarrow \lambda$
$S\rightarrow (x$$\text{ }| E]$$\text{ }| F)$$X\rightarrow E)$$\text{ }| F]$$E\rightarrow A$$F\rightarrow A$$A\rightarrow \lambda$
User Avatar
1 votes
1 votes
1 answer
4
worst_engineer asked Jan 4, 2016
548 views
Is the following grammar LL1
In the explanation, it is mentioned as follows Now , my question is how First(B) is a here. Can you please explain it ?
In the explanation, it is mentioned as followsNow , my question is how First(B) is a here. Can you please explain it ?
User Avatar
Link Copied!