Recent questions and answers in Compiler Design

0 votes

1 answer

Self Doubt: Parsers
Consider the following two grammars G1: A → A1 | 0A1 | 01 G2: A → 0A | 1 Which of the following is True regarding above grammars? (a) L1 is LR(k) (b) L2 is LR(k) (c) Both L1 and L2 is LR(k) (d) None is LR(k)

answered 2 days ago in Compiler Design by Satbir (1k points) | 11 views

0 votes

1 answer

Self Doubt in Parsers
“Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter” True or False? What about LR(0) for the same?

answered 2 days ago in Compiler Design by Satbir (1k points) | 16 views

0 votes

1 answer

Gateforum Test Series: Compiler Design
The least number of total variables needed to create a three address code in static single assignment form for the following code segment is: q=3 r=10 s=q+r t=2*r+s t=q u=q+r v=q+t t=3+x

answered 2 days ago in Compiler Design by Satbir (1k points) | 27 views

0 votes

1 answer

GateForum Test Series: CD
Consider the following grammar, where S and T are non-terminals and +, * and a are terminals. S→S∗S|S+S|T|a T→a The total number of possible parse trees for the string a∗a+a is?

answered 4 days ago in Compiler Design by Satbir (1k points) | 12 views

0 votes

0 answers

GO CD Test 2019
For which of the following languages a LL(1) grammar does not exist? {$a^{n}ob^{n}$∣n≥1}∪{$a^{n}b^{n}$∣n≥1} {$a^{n}b^{m}$∣m,n≥0} {$a^{i}b^{j}$∣i≥j} {$a^{i}b^{j}$∣i=j} Why C is the answer here? Can anyone explain?

asked 5 days ago in Compiler Design by Sambhrant Maurya (281 points) | 6 views

0 votes

0 answers

LEXICAL ANALYSIS -TOKENS
Can anyone provide me with the a source for learning how tokens are generated in lexical analysis ?And the various rules associated with it?

asked 6 days ago in Compiler Design by Doraemon (139 points) | 5 views

0 votes

1 answer

Self Doubt: CFG
What are “sentential forms”,”left sentential form”, “right sentential form” and “rightmost sentential form”? Please explain with an example.

answered Aug 16 in Compiler Design by Satbir (1k points) | 6 views

0 votes

0 answers

Self Doubt: Operator precedence parser
a ( ) , $ a > > > ( < < = < ) > > > , < < > > $ < < How to construct the operator function graph for this operation relation table? I know the general procedure but here the “=” is causing troubles.

asked Aug 15 in Compiler Design by Sambhrant Maurya (281 points) | 8 views

0 votes

0 answers

Compiler Design Doubt
Consider the following grammar S→S(S)| ∈ Which one of the following is true 1. Grammar is ambiguous 2. Grammar is unambiguous 3. The grammar will generate all strings having balanced parenthesis a) 1 and 3 b) 2 and 3 c) 1 only d) 2 only

asked Aug 14 in Compiler Design by DukeThunders (208 points) | 18 views

0 votes

0 answers

Shortcut to identify LR, LL grammars
Hello all, I have been trying to figure out some shortcuts to say whether a given grammar is LL(k) or LR(k). Drawing state table is time consuming. What are some shortcut tricks that can be used? One which I know is if the grammar is ambiguous, it can’t be LL(k) or LR(k). Thank you.

asked Aug 14 in Compiler Design by DukeThunders (208 points) | 6 views

0 votes

1 answer

Made easy notes
count number of tokens in the following c statement: char a[5]=”abcd”;

answered Aug 2 in Compiler Design by Rudr Pawan (419 points) | 14 views

+2 votes

4 answers

fssai IT assistant exam 2019 Q15
What is the maximum number of language a context-free Grammar (CFG) can generate? Three Two One Infinite

answered Jul 31 in Compiler Design by Chinmay Agnihotri (106 points) | 137 views

0 votes

1 answer

Ace test series-LL1
Is there any difference between left factoring and left factored?? Why I am asking this is as per my knowledge LL1 grammar should be : No ambiguous, No left factoring, No left recursion but in Ace : option no ambiguous , no left recursion ,Left factored is right no ambiguous , no left recursion ,no Left factored is wrong

answered Jul 27 in Compiler Design by user2525 (1.6k points) | 10 views

0 votes

0 answers

Recursive descent parser
Consider the following statements: 1. Recursive descent parser can use left recursive grammar. 2. Leaf nodes of tree is synthesized attribute . Which of the above statement is correct? Given ans : both 1 and 2. My doubt is Top down parser cannot parse the left recursive Grammar and Recursive descent parser is Top down parser so is 1 statement true ?

asked Jul 24 in Compiler Design by Brij gopal Dixit (130 points) | 8 views

0 votes

1 answer

Made easy test series#compiler design
Tell me the answer of this question, I think answer given is wrong

answered Jul 24 in Compiler Design by Sumiran Agrawal (128 points) | 6 views

0 votes

1 answer

Self Doubt: Compiler Design
What is the logic behind seperating Shift moves/reduce moves and Goto moves in parsing table?

answered Jul 16 in Compiler Design by user2525 (1.6k points) | 10 views

0 votes

1 answer

MADE EASY 2020 :CD test 2020
Consider the following statements:→ S1.In stack allocation memory is allocated at compile time, while in heap it is allocated at run time S2. Recursion is supported in stack allocation technique but not in static allocation technique Which is true? S1 and S2 only S1 only S2 Neither

answered Jul 14 in Compiler Design by Alakhator (355 points) | 38 views

0 votes

0 answers

LR Parser in compiler design
Can anyone give a counter-example grammar which proves that LR parsers cant parse every non – deterministic unambiguous CFL ?

asked Jul 13 in Compiler Design by user2525 (1.6k points) | 11 views

0 votes

2 answers

MadeEasy TestSeries
Some please solve this!

answered Jul 13 in Compiler Design by Debargha Bhattacharj (1.3k points) | 19 views

0 votes

0 answers

grammar and parser
I m bit confused in types of grammar, which is parsed by what type of parser. plz clear it. Can LR parser, parse only context free grammar or it can parse context sensitive grammar? If no, then which parser is used for CSG?

asked Jul 13 in Compiler Design by Shubhm (132 points) | 5 views

0 votes

1 answer

MADE EASY CD 2020.
The following program uses six temporary variables p,q,r,s,t,u. The code is→ Assuming that all operations take their operands from registers. The minimum number of registers needed to execute this program without spilling is ________.

answered Jul 13 in Compiler Design by Debargha Bhattacharj (1.3k points) | 35 views

0 votes

1 answer

MADE EASY COMPILER DESIGN
Assume +, –, ×, / are usual arithmatic operator, + has highest precedence and right associative and –, ×, / have equal precedence and left associative. The output of the following expression is ________. 18 × 2 – 8 + 9 – 3 × 10/5

answered Jul 12 in Compiler Design by Debargha Bhattacharj (1.3k points) | 26 views

0 votes

1 answer

MADE EASY: COMPILERS GATE 2020
Which of the following can be the correct handle in bottom up parsing for the given grammar? (id) id * C id* (id) None of these

answered Jul 12 in Compiler Design by user2525 (1.6k points) | 12 views

0 votes

0 answers

MADE EASY COMPILERS 2020
Total number of reductions using LR(1) parser for the string p + p * pr using the given grammar ________.

asked Jul 12 in Compiler Design by Hirak (1.3k points) | 5 views

0 votes

1 answer

MADE EASY GATE 2020 CD
Which of the following grammar is non-left recursive and is equivalent to G

answered Jul 12 in Compiler Design by user2525 (1.6k points) | 82 views

0 votes

1 answer

MADE EASY 2020
In a compiler the module that checks the token arrangement against the source code grammar is called ________. Lexical analyzer Syntax analyzer semantic analyzer code optimizer

answered Jul 12 in Compiler Design by user2525 (1.6k points) | 34 views

0 votes

0 answers

MADE EASY 2020 CD
The number of tokens in the following C-code ________.

asked Jul 12 in Compiler Design by Hirak (1.3k points) | 64 views

0 votes

0 answers

MADE EASY CD 2020
Consider the following code segment The minimum number of total variables required to convert the above code segment to static single assignment form is ________.

asked Jul 12 in Compiler Design by Hirak (1.3k points) | 44 views

0 votes

1 answer

in which phase most of the time for compilation is spent and why?

answered Jul 8 in Compiler Design by Shivateja MST (127 points) | 19 views

0 votes

0 answers

Top Down Parsing
Why LL(1) grammar is unambiguous?

asked Jul 8 in Compiler Design by Somdatta Sen (104 points) | 11 views

0 votes

0 answers

What is the grammar for generating strings like a=b=c?

asked Jul 3 in Compiler Design by Dmmodi (194 points) | 8 views

+1 vote

1 answer

Vani Qs Bank, Lexical Analysis
Number of tokens in the below expression is→ sum = sum + unit * /*accumulate sum*/ 1.2e-12 ; 7 8 9 10

answered Jun 30 in Compiler Design by Verma Ashish (305 points) | 11 views

0 votes

0 answers

Vani Qs Bank, Compiler Design
if x<b fn1() else fn2() In which phase the error is detected? Lexical Analysis Syntax Analysis Semantic Analysis No error, the code runs fine

asked Jun 30 in Compiler Design by Hirak (1.3k points) | 7 views

0 votes

0 answers

Syntax Analysis
The syntax analysis part of a compiler known as a.language generator b.language recognizer c.context free grammar d.assembler

asked Jun 27 in Compiler Design by Prajna (120 points) | 5 views

0 votes

0 answers

code optimization
Ques: The expression (a*b)*c op.. where ‘op’ is one of +,* and ^ (exponential) can be evaluated on CPU with a single register without storing the value of (a*b) if a)’op’ is ‘+’ or ‘*’ b)’op’ is ‘^’ or ‘*’ c)’op’ is ‘^’ or ‘+’

asked Jun 23 in Compiler Design by gulshanmathur (102 points) | 10 views