The regular grammar for the language L = {anbm | n + m is even} is given by

[Solved] The regular grammar for the language L = {anbm

Q.	The regular grammar for the language L = {anbm \| n + m is even} is given by
A.	S → S1 \| S2 S1 → a S1\| A1 A1 → b A1\| λ S2 → aaS2\| A2 A2 → b A2\| λ
B.	S → S1 \| S2 S1 → a S1\| aA1 S2 → aaS2\| A2 A1 → b A1\| λ A2 → b A2\| λ
C.	S → S1 \| S2 S1 → aaa S1\| aA1 S2 → aaS2\| A2 A1 → b A1\| λ A2 → b A2\| λ
D.	S → S1 \| S2 S1 → aa S1\| A1 S2 → aaS2\| A2 A1 → bb A1\| λ A2 → bb A2\| λ
Answer» D. S → S1 \| S2 S1 → aa S1\| A1 S2 → aaS2\| A2 A1 → bb A1\| λ A2 → bb A2\| λ

635

Do you find this helpful?

View all MCQs in

Theory of Computation and Compiler Design

Discussion

No comments yet

Related MCQs

Which of the following are decidable ? 1. whether the intersection of two regular language is infinite. 2. whether a give context free language is regular 3. whether two push down automata accept the same language. 4. whether a given grammar is context free
Consider the following expression grammar. The seman-tic rules for expression calculation are stated next to each grammar production. E → number E.val = number. val | E '+' E E(1).val = E(2).val + E(3).val | E '×' E E(1).val = E(2).val × E(3).val The above grammar and the semantic rules are fed to a yacc tool (which is an LALR (1) parser generator) for parsing and evaluating arithmetic expressions. Which one of the following is true about the action of yacc for the given grammar?
Which of the following are decidable? I. Whether the intersection of two regular languages is infinite II. Whether a given context-free language is regular III. Whether two push-down automata accept the same language IV. Whether a given grammar is context-free
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE?
Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a context-free language, then is L’ (complement of L) also context-free? 3) If L is a regular language, then is L’ also regular? 4) If L is a recursive language, then, is L’ also recursive?
Consider the following grammar. S -> S * E S -> E E -> F + E E -> F F -> id Consider the following LR(0) items corresponding to the grammar above. (i) S -> S * .E (ii) E -> F. + E (iii) E -> F + .E Given the items above, which two of them will appear in the same set in the canonical sets-of-items for the grammar?
Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?
Let L={w \in (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?
Consider the following grammar: S → FR R → S | ε F → id In the predictive parser table, M, of the grammar the entries M[S, id] and M[R, $] respectively.
The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is