Register

Grammer

• edited by
235 views
0 votes
0 votes

S --> id = E

E --> E + T / T

T --> T * F / F

F --> id 

S --> while E do SL

SL --> SLS /€

 

The above grammar is :

a) LL(1)

b) LR(0)

c) SLR(1)

d) LR(1)

• 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
5 answers
2
Abhishek Malik asked Apr 5, 2018
1,316 views
Finding Handles in a grammer
Total number of Handles for $(w=aa)$ in the following grammar ? $S\rightarrow DT$ $D\rightarrow aa$ $T\rightarrow \epsilon$
Total number of Handles for $(w=aa)$ in the following grammar ?$S\rightarrow DT$$D\rightarrow aa$$T\rightarrow \epsilon$
User Avatar
1 votes
1 votes
0 answers
3
Saransh Dave asked Jan 4, 2018
198 views
Is this a determiniatic grammer ?
What would be the un-ambiguous version of the grammer S -> iEtS/iEtSeS/a E -> b if to remove ambiguity, we consider that every else is associated with its nearest previous if condition. I think it should be S -> iEtS/P P -> iEtPeP/a E -> b But this dosen't look like a deterministic grammer. So what should it be ?
What would be the un-ambiguous version of the grammer S - iEtS/iEtSeS/aE - b if to remove ambiguity, we consider that every else is associated with its nearest previous ...
User Avatar
0 votes
0 votes
2 answers
4
pa-try asked Dec 5, 2017
571 views
LL1 grammer
User Avatar
Link Copied!