Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

2 votes
0 answers
991
LL(k)
I know that LL(1) grammar can have No left factoring ,No Left recursion and No Ambiguity. Is same thing true for LL(k) as well i.e. LL(k) which is reading k symbols at a time from input string. Does LL(k) grammar can have No left factoring ,No Left recursion and No Ambiguity ?
I know that LL(1) grammar can have No left factoring ,No Left recursion and No Ambiguity.Is same thing true for LL(k) as well i.e. LL(k) which is reading k symbols at a...
User Avatar
0 votes
0 answers
992
Associativity
The grammar $S\rightarrow FA$ $A\rightarrow \epsilon |\Phi TA$ $F\rightarrow i$ reflects that a)$\Phi$ is left associative b)$\Phi$ is right associative c)cannot deduce association from the grammar d) none of above
The grammar$S\rightarrow FA$$A\rightarrow \epsilon |\Phi TA$$F\rightarrow i$reflects thata)$\Phi$ is left associativeb)$\Phi$ is right associativec)cannot deduce associat...
User Avatar
0 votes
1 answer
993
ambiguity
$E→E−T ∣ T$ $T→T/F ∣ F$ $F→(E) ∣ id$ (E is the start symbol) This grammar is unambiguous but shouldn't it be ambiguous because it has left recursion?
$E→E−T ∣ T$$T→T/F ∣ F$$F→(E) ∣ id$(E is the start symbol)This grammar is unambiguous but shouldn't it be ambiguous because it has left recursion?
User Avatar
0 votes
1 answer
995
Ace Test Series: Compiler Design - Parsing
S-> Aa A-> Ab A-> c Which of the following item is present in LR(1) item with S'->. S, $ a) A->. Ab,$ b) A->. Ab,a c) A->. Ab,a/b d) None
S- AaA- AbA- cWhich of the following item is present in LR(1) item with S'->. S, $a) A->. Ab,$b) A->. Ab,ac) A->. Ab,a/bd) None
User Avatar
2 votes
3 answers
996
M.E test
Let G be a grammar with the following productions. If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item in the initial state?
Let G be a grammar with the following productions.If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...
User Avatar
0 votes
2 answers
997
test series
Consider the following statements: S1 : Three-address code is a linearized representation of syntax tree. S2 : The syntax tree not depicts the natural hierarchical structure of source program. Which of the following is true? plz explain s1 statement
Consider the following statements:S1 : Three-address code is a linearized representation of syntax tree.S2 : The syntax tree not depicts the natural hierarchical structur...
User Avatar
2 votes
1 answer
1000
ISRO-DEC2017-68
Consider the following table : ... $a-q, b-r, c-s, d-p$ $a-r, b-s, c-q, d-p$ $a-r, b-s, c-p, d-q$
Consider the following table :$\begin{array}{|l|l|l|} \hline \textbf{A.} & \text{Activation record} & \textbf{p.} & \text{Linking loader} \\\hline \textbf{B.} & \text{Loc...
User Avatar
0 votes
1 answer
1002
compiler syllabus
Are code optimization concepts regarding basic blocks in gate syllabus 2018 or not?
Are code optimization concepts regarding basic blocks in gate syllabus 2018 or not?
User Avatar
0 votes
1 answer
1003
syntactic directed definition
if any production of given grammar is A → ε {A.v = 0} then A.v is ? a) inherited attribute b) synthesized attribute
if any production of given grammar isA → ε {A.v = 0}then A.v is ?a) inherited attributeb) synthesized attribute
User Avatar
0 votes
0 answers
1005
#ll(k)
what are the pros and cons in LL(k) parsing with larger values of k?
what are the pros and cons in LL(k) parsing with larger values of k?
User Avatar
1 votes
1 answer
1006
#CD Doubt
What is the diffrence between Lexical error , Syntax error and semantic error..? Please explain with this example void main() { int total-value, Num=2,sum=5,var1; 5=Num; var1=2; sum=num*1; if(sum=var1) { sum=sum+1 } }
What is the diffrence between Lexical error , Syntax error and semantic error..?Please explain with this examplevoid main(){int total-value, Num=2,sum=5,var1;5=Num;var1=2...
User Avatar
0 votes
1 answer
1007
Lalr1 parsing
Consider the below given grammar: S→(A S→B] S→C) A→B) A→C] B→D C→D D→ϵ The number of states in LALR(1) canonical item set are _______ and number of inadequate states (if any) in LALR(1) canonical item set is/are ____________respectively.
Consider the below given grammar: S→(A S→B] S→C) A→B) A→C] B→D C→D D→ϵ The number of states in LALR(1) canonical item set are _______ and number of inade...
User Avatar
0 votes
1 answer
1009
LL(1)
User Avatar
1 votes
1 answer
1010
Regular Grammar
A regular grammar is always linear but not all linear grammar are regular. Please explain why this statement is true
A regular grammar is always linear but not all linear grammar are regular.Please explain why this statement is true
User Avatar
0 votes
1 answer
1012
SSC-IMD-2017-06
Which of the following is not a function of pass1 of an assembler? 1) Generate data 2) Keep track of LC 3) Remember literals 4) Remember values of symbols until pass 2
Which of the following is not a function of pass1 of an assembler?1) Generate data 2) Keep track of LC 3) Remember literals 4) Remember values of symbols until pass 2
User Avatar
0 votes
2 answers
1017
LL1 grammer
User Avatar
0 votes
0 answers
1019
Equality of parsers
User Avatar
Page: