Recent questions and answers in Compiler Design - GATE CSE Doubts

0 votes

0 answers

Testbook Compiler Design test doubt
Will it give a lexical error or a syntactic error?

asked 1 hour ago in Compiler Design by Abhipsa Mishra (15 points) | 9 views

0 votes

0 answers

SELF DOUBT: AUTOMATA
Is $(Regular$ $language) -CFL$ always $regular$? [closed]

asked 1 hour ago in Compiler Design by Debapaul (310 points) | 2 views

0 votes

0 answers

Self doubt in number of tokens
Should we consider ternary operator as a single token or two tokens?

asked 3 hours ago in Compiler Design by Abhipsa Mishra (15 points) | 4 views

0 votes

0 answers

GATE GURU : DSA 405
in Chiluvuru' village there are many mathematicians and algorithm experts. They are always playing with numbers. In that village there is a young student and his name is Bahubali. He is interested in sorting algorithms. So, he taken a sorted array of n elements which has been circularly ... try to help him to find time complexity. 1. O(nlogn) 2. O(logn) 3. O($n^2$) 4. O(n)

asked 6 days ago in Compiler Design by Debapaul (310 points) | 20 views

0 votes

1 answer

MADE EASY: GATE 2020 COMPILERS
Consider the following grammarsG1 and G2 G1: S→ aS | ε G2: S→Sa | ε Select the correct option. 1. G1 and G2 generate different parse tree for all strings. 2. L(G1) ≠ L(G2). 3. G1 is LR(0) while G2 is not LR(0) 4. G2 is LR(0) while G1 is not LR(0)

answered 6 days ago in Compiler Design by Mk Utkarsh (302 points) | 19 views

0 votes

1 answer

Made Easy: CD
How many states are there in LR(0) parsing of the following grammar $E→ E+T / T$ $T→ T*F / F$ $F→ (E)/id$

answered 6 days ago in Compiler Design by Vimal Patel (387 points) | 15 views

0 votes

0 answers

Made easy test series : Run time environment
Plz answer the above question.

asked 6 days ago in Compiler Design by vishal burnwal (57 points) | 7 views

0 votes

1 answer

Compiler Design Self Doubt Gate Guru Notes
So in which phase does the $Intermediate$ $code$ $representation$ lies?

answered Dec 5 in Compiler Design by Priyansh Singh (122 points) | 14 views

0 votes

0 answers

ACE GATE Mock Test 11 Q32 Grammar types
I am getting both B and C as correct. Please help in clarifying my doubt.

asked Dec 4 in Compiler Design by DukeThunders (288 points) | 7 views

0 votes

0 answers

ACE GATE Mock Test 12 Q60 SDT

asked Dec 4 in Compiler Design by DukeThunders (288 points) | 11 views

0 votes

0 answers

madeeasy test series 2019 compiler design
+,-,*,/ have their usual meanings + has highest precedence and right associative where -,*,/ have equal precedence and left associative output of following expression is: 18*2-8+9-3*10/5 given answer is:13… i am getting 32

asked Dec 3 in Compiler Design by eyeamgj (17 points) | 14 views

0 votes

0 answers

#self Doubt- Compiler Design
Find True and False Grammar parsed ny LL(1) parser must be parsed by SLR(1) parser. Grammar which is not parsed by LALR(1) parser can not parsed by LL(1) parser. If any Grammar SLR(1) then it should be CLR(1).

asked Dec 2 in Compiler Design by Hradesh patel (6 points) | 7 views

0 votes

1 answer

Ace Test series Top down parsing SDT
Question Answer as per Ace As far as I know Tree is traversed in Left most (DFS) so correct answer should be “*+”.

answered Nov 30 in Compiler Design by Pratyush Priyam Kuan (392 points) | 16 views

0 votes

0 answers

Count the number of Tockens
Count the number of Tokens a+=c; I guess u can understand my confusion, which is whether to consider $+=$ as a single tocken or not?

asked Nov 30 in Compiler Design by Debapaul (310 points) | 16 views

0 votes

0 answers

Compiler Design Test Series Doubt
I am getting 13 as answer but answer given as 15 someone help me understand where i am going wrong

asked Nov 27 in Compiler Design by Piyush #### (9 points) | 17 views

0 votes

0 answers

why is it not clr(1)
S->Sa | aSb | ε why this grammer is not clr(1)? because i have tried multiple times with state diagram and found not any RR or SR conflict and i think that it is clr(1) but in answer of test series it is given that it is not clr(1). so if anyone can explain in details why it is not clr(1).

asked Nov 27 in Compiler Design by vijay kumar 2 (15 points) | 29 views

0 votes

0 answers

ACE Test Series Compiler Test 57 Left Factoring
What is wrong with option A? Answer is given as B.

asked Nov 26 in Compiler Design by DukeThunders (288 points) | 38 views

0 votes

1 answer

#compiler design LALR
Let G ne a grammar with the following production $E\rightarrow E+T|T $ $T\rightarrow T*F|F$ $ T\rightarrow (E)|T-F$ $ F\rightarrow id$ If LR(1) parser is used to construct DFA using above production then how many look ahead are present for an item $T\rightarrow .T*F$ in the initial state._____________

answered Nov 21 in Compiler Design by shaktisingh (87 points) | 52 views

0 votes

0 answers

#compiler design
n>>=123456789; number of token

asked Nov 21 in Compiler Design by amit166 (113 points) | 20 views

0 votes

0 answers

Madeeasy workbook (Parsing)
Consider the following grammer: S → S | S;S S → V = E V → id[E] | id E → id | (E) Find the number of conflicts in LR(0).

asked Nov 20 in Compiler Design by chinmayetw (6 points) | 4 views

0 votes

0 answers

Compiler doubt
If grammar is LL(1) and not contain epsilon then it is SLR(1) true or false

asked Nov 17 in Compiler Design by amit166 (113 points) | 23 views

0 votes

0 answers

#compiler design LL(1)
Check whether grammar is LL(1) or not? 1.decidable 2.undecidable

asked Nov 17 in Compiler Design by amit166 (113 points) | 24 views

0 votes

1 answer

Ace Compiler design CS_GATE_2020_45
Can anyone tell how to solve the below question?

answered Nov 15 in Compiler Design by srestha (558 points) | 120 views

0 votes

0 answers

Gatebook: Compiler Design
Consider the context-free grammar G : S → aSbS | bSaS | ε How many parse trees are there for the sentence ababababab ? Doubt: When can Catalan number be used for finding number of parse trees? And what is the general procedure for finding the number of parse trees in a question like this where the number of such trees is large? Answer is 42.

asked Nov 14 in Compiler Design by Sambhrant Maurya (290 points) | 18 views

0 votes

0 answers

Made Easy Test Series Compiler Design (topic wise Q.16) [closed]

asked Nov 13 in Compiler Design by arya_stark (64 points) | 23 views

0 votes

1 answer

Made easy test series compiler design
Consider the following program code with 5 temporary variables a, b, c, d, e: a=20 b=25 c=a*b d=c+a e=3 c=e*d e=c+b Assume that all operations take their operands from register, minimum number of register needed to execute this code without spilling ____

answered Nov 11 in Compiler Design by pranay562 (666 points) | 44 views

0 votes

0 answers

MADE EASY: FLT 1
Consider a processor having 32-bit word size and 32KB 8-way set associative cache where each cache line holds four words. If we assume that the machine is byte-addressable. Where in the cache is the word from memory location 3A2D6C0F mapped? 1. Set no. - ... as the physical address, but how can they consider so? It is no where mentioned that 32 bit is same as the physical address!

asked Nov 10 in Compiler Design by Debapaul (310 points) | 15 views

0 votes

0 answers

#madeeasyTestSeries

asked Nov 8 in Compiler Design by Pradeep Verma (10 points) | 24 views

0 votes

0 answers

Self Doubt: panic mode recovery compiler design
code: begin a = b + c; x = p r; // here syntax error h = x < 0 ; end so, it discards the input symbols and moves forward one at a time until the next semicolon here in this case. Ullman book used the word input symbols ... use stack here for panic mode recovery? If it is using stack then what are the items in the stack left ,show the process? ..

asked Nov 7 in Compiler Design by shaktisingh (87 points) | 11 views

+1 vote

1 answer

IITM Quiz compiler design
True/False (a) Every lexical token can also be specified using context free grammar. (b) LL parsing not used in practice. (c) LR parsing stands for Left-to right parsing Right most derivation . (d) If a grammar is SLR(1) then LR ... is less than that of CYK algorithm. (p) Predictive parsing is less powerful than LL parsing with backtracking. Reference CSE IITM QUIZ

answered Nov 5 in Compiler Design by GAITONDE (1.6k points) | 33 views

0 votes

0 answers

Compilers-Principle,Techniques & tools(Ullman)-2e-Chapter:3-Lexical analysis

asked Nov 4 in Compiler Design by Kushagra गुप्ता (155 points) | 23 views

0 votes

0 answers

MadeEasy Compiler Design 50 marks test 2019: Q7 Condition for LL(1)

asked Nov 4 in Compiler Design by DukeThunders (288 points) | 15 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-2 (GATE - 2020) Q16 paring table

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 60 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-2 (GATE - 2020) Q10

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 13 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-1 (GATE - 2020) Q15 expression evaluation

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 9 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-1 (GATE - 2020) Q11 on DAG

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 15 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-1 (GATE - 2020) Q8 Is $ a terminal?

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 15 views

0 votes

1 answer

MadeEasy TOPICWISE : COMPILER DESIGN-2 (GATE - 2019) Q10 SDT

answered Nov 3 in Compiler Design by pranay562 (666 points) | 12 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-2 (GATE - 2019) Query about LR(1) items Q16Q17

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 8 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-1 (GATE - 2019) Q17 Spilling

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 21 views

To see more, click for all the questions in this category.

Recent questions and answers in Compiler Design

2,315 questions

1,294 answers

6,599 comments

89,719 users