Recent questions tagged compiler-design

0 votes
0 answers
1262
The given answer is A) but option A) produces the string "ab" which is not produced by the above grammar so how can the answer be A) ?
1 votes
0 answers
1263
If in the state table of a LR parser, in some row, we have more than one SR or RR conflict, then is it considered a single conflict?Reference:- https://gateoverflow.in/11...
1 votes
0 answers
1265
The number of states in SLR parser for G is _______.for this type of question , Do we consider augmented entry state like S'->S. ????
0 votes
1 answer
1266
in case of shift-reduce and R-R conflict, which is favored by YACC?
1 votes
2 answers
1267
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
0 votes
1 answer
1268
I have only one day remaining, I haven't done anything of Compiler Design, what topic should I do?
0 votes
1 answer
1270
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
0 votes
2 answers
1273
Consider the grammar-$S \rightarrow BB$$B \rightarrow aB/bB/a/b$How many shift-reduce conflicts will occur when we try to make SLR parsing table for the above grammar?A. ...
1 votes
1 answer
1274
I feel answer is 70 in hexadecimal.need confirmation?
0 votes
1 answer
1276
0 votes
3 answers
1278
1 votes
5 answers
1279
0 votes
2 answers
1283
An umambiguous grammar has same right most and left most derivation>??True or false.?
0 votes
1 answer
1285
4 votes
0 answers
1290
The number of tokens in the following expression is what?+ * * * < = & { - + + + } ( > ) + & &