Question
a.
Scanner
b.
Parser
c.
Semantic Analyzer
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. Grammar is checked by which component of compiler
Similar Questions
Discover Related MCQs
Q. A symbol X is ________ if there exists : S->* aXb
View solution
Q. A symbol X is called to be useful if and only if its is:
View solution
Q. Which of the following is false for a grammar G in Chomsky Normal Form:
View solution
Q. Given Checklist:
a) G has no useless symbols
b) G has no unit productions
c) G has no epsilon productions
d) Normal form for production is violated
Is it possible for the grammar G to be in CNF with the following checklisy ?
View solution
Q. State true or false:
Statement: A CNF parse tree’s string yield (w) can no longer be 2h-1.
View solution
Q. If |w|>=2^h, then its parse tree’s height is at least _____
View solution
Q. If w belongs to L(G), for some CFG, then w has a parse tree, which tell us the ________ structure of w.
View solution
Q. Which of the following are distinct to parse trees?
View solution
Q. Choose the correct option:
Statement: Unambiguity is the ideal structure of a language.
View solution
Q. Is the given statement correct?
Statement: The mere existence of several derivations is not an issue, its is the existence of several parse trees that ruins a grammar.
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!