Question
a.
dangling else problem
b.
halting problem
c.
maze problem
d.
none of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which of the following is an real-world programming language ambiguity?
Similar Questions
Discover Related MCQs
Q. Which of the following is a parser for an ambiguous grammar?
View solution
Q. A language that admits only ambiguous grammar:
View solution
Q. Which of the following is an example of inherent ambiguous language?
View solution
Q. State true or false:
Statement: R->R|T T->ε is an ambiguous grammar
View solution
Q. In context to ambiguity, the number of times the following programming statement can be interpreted as:
Statement: if R then if T then P else V
View solution
Q. CFGs can be parsed in polynomial time using__________
View solution
Q. Suppose A->xBz and B->y, then the simplified grammar would be:
View solution
Q. Given Grammar: S->A, A->aA, A->e, B->bA
Which among the following productions are Useless productions?
View solution
Q. Given:
S->…->xAy->…->w
if ____________, then A is useful, else useless symbol.
View solution
Q. Given:
S->aSb
S->e
S-> A
A->aA
B->C
C->D
The ratio of number of useless variables to number of useless production is:
View solution
Q. Given grammar G:
S->aS|A|C
A->a
B->aa
C->aCb
Find the set of variables thet can produce strings only with the set of terminals.
View solution
Q. Given grammar:
S->aS|A
A->a
B->aa
Find the number of variables reachable from the Starting Variable?
View solution
Q. Inorder to simplify a context free grammar, we can skip the following operation:
View solution
Q. Given a Grammar G:
S->aA
A->a
A->B
B->A
B->bb
Which among the following will be the simplified grammar?
View solution
Q. Simplify the given grammar:
A-> a| aaA| abBc
B-> abba| b
View solution
Q. In context to the process of removing useless symbols, which of the following is correct?
View solution
Q. The use of variable dependency graph is in:
View solution
Q. The variable which produces an epsilon is called:
View solution
Q. Statement:
For A-> e ,A can be erased. So whenever it appears on the left side of a production, replace with another production without the A.
State true or false:
View solution
Q. Simplify the given grammar:
S->aXb
X->aXb | e
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!