Register

exam 2011

• retagged by
112 views

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

624
views
2 answers
0 votes
Jayant Isswani asked May 2, 2018
624 views
Compiler design semester exam question
Can the following grammar be parsed by LR(0) parser?E -> E+id | idIs the accept state entry considered on all the terminal symbol columns for LR(0) parser?
User Avatar
7.3k
views
4 answers
38 votes
go_editor asked Sep 29, 2014
7,343 views
GATE CSE 2011 | Question: 27
Consider two binary operators $\text{ } \uparrow \text{'}$ and $\text{ } \downarrow \text{'}$ with the precedence of operator $\downarrow$ being lower than ... parse tree for expression $(7 \downarrow 3 \uparrow 4 \uparrow 3 \downarrow 2)$
User Avatar
1.0k
views
0 answers
4 votes
GO Classes asked Feb 5
1,038 views
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 53
The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?
User Avatar
450
views
1 answers
4 votes
GO Classes asked Jan 21
450 views
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 16
Consider the following context-free grammar, with start symbol $S$ and terminals $a, ; , \lt , \gt .$ ... many different parse trees are there for the string $\lt \lt a \gt ;a\gt ?$
User Avatar
Link Copied!