Register

Recent questions tagged ambiguous-grammar

0 votes
1 answer
31
Operator Precedence
E → E + E | E * E | ( E ) | id What will be operator precedence for above grammar.Is precedence differs due to ambiguity
E → E + E | E * E | ( E ) | idWhat will be operator precedence for above grammar.Is precedence differs due to ambiguity
User Avatar
0 votes
1 answer
33
gate 2001
An unambiguous grammar has same leftmost and rightmost derivation Please provide an example to show this.
An unambiguous grammar has same leftmost and rightmost derivationPlease provide an example to show this.
User Avatar
1 votes
4 answers
34
Compiler
Consider the following grammar 1)Left Recursive 2)Ambiguos 3)Left factored 4)None of these
Consider the following grammar1)Left Recursive2)Ambiguos3)Left factored4)None of these
User Avatar
1 votes
2 answers
35
Compiler
Consider the grammar given below. It is E -> T+E | T T -> a a. SLR(1) but not LL(1) b. Not an operator grammar c. Ambiguous d. None of these
Consider the grammar given below. It isE - T+E | TT - aa. SLR(1) but not LL(1)b. Not an operator grammarc. Ambiguousd. None of these
User Avatar
0 votes
1 answer
36
SLR(1) Parser
Every SLR grammar is unambiguous. True or False? Why?
Every SLR grammar is unambiguous. True or False? Why?
User Avatar
0 votes
1 answer
39
Ambiguity
If the grammar be left recursive then is it always be ambiguous?
If the grammar be left recursive then is it always be ambiguous?
User Avatar
1 votes
1 answer
41
Doubt
User Avatar
0 votes
2 answers
42
ME = Compiler
Whether Grammar $S \rightarrow SS/ab$ ambiguous ? Please derive some strings?
Whether Grammar $S \rightarrow SS/ab$ ambiguous ? Please derive some strings?
User Avatar
0 votes
1 answer
43
Parsing
which is false? a) An unambiguous grammar has same RMD for every sentence. b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the language generated.
which is false?a) An unambiguous grammar has same RMD for every sentence.b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the la...
User Avatar
1 votes
2 answers
46
Ambiguous grammar
Is the given grammar ambiguous? S->AB A->a B->b
Is the given grammar ambiguous?S->ABA->aB->b
User Avatar
2 votes
1 answer
47
CFG is ambiguous is it possible to make top down and bottom up parsing?
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct???
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct?...
User Avatar
2 votes
1 answer
48
S-> iEtSS'|a S-> eS|epsilon E->b
The LL(1) parsing table for the above grammar is Nonterminal a b e i t ... WHY we always choose S' ->eS production to remain in this parse table why not S' -> epsilon? Answer this..???
The LL(1) parsing table for the above grammar is Nonterminalabeit$SS->a S->iEtSS' S' S' ->epsilonS' ->es S'->epsilonE E->b By looking the parse table we found mult...
User Avatar
1 votes
1 answer
50
ambigious grammer
how to verify weather given grammer is ambigious or not???
how to verify weather given grammer is ambigious or not???
User Avatar
Page: