Register

made easy test series

292 views
1 votes
1 votes

Consider the following grammar G:


The grammar G is
A)LL (1) grammar and not LR (0)
B)LL (1) and LR (0)
C)Not LL (1) but LR (0)
D)Neither LL (1) nor LR (0)

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
0 answers
1
alankrit01 asked Jan 2
165 views
Made Easy Test Series
User Avatar
0 votes
0 votes
1 answer
2
yashss2001 asked Jan 1
245 views
Made Easy Test Series Question
Consider the following C code: d=a+b e=a-b f=c+d g=c-e a=f+g b=f-g c=d+e The minimum number of total variables required to convert the above code segment to static single assignment form is? Ans given is 7 but how
Consider the following C code:d=a+be=a-bf=c+dg=c-ea=f+gb=f-gc=d+eThe minimum number of total variables required to convert the above code segment to static single assignm...
User Avatar
2 votes
2 votes
0 answers
3
Rahhul A asked Nov 10, 2023
196 views
Made Easy Test Series - Compiler Design
User Avatar
1 votes
1 votes
3 answers
4
Rahhul A asked Nov 10, 2023
539 views
Made Easy Test Series - Compiler Design
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
User Avatar
Link Copied!