Left hand side of a production in CFG consists of:

Related MCQs

• The following CFG is in S → AB**spaceB → CD**spaceB → AD**spaceB → b**spaceD → AD**spaceD → d**spaceA → a**spaceC → a
• Consider the following CFG S → aB S → bA**spaceB → b A → a**spaceB → bS A → aS**spaceB → aBB A → bAA**space Consider the following derivation **spaceS ⇒aB**space⇒aaBB**space⇒aaBb**space⇒aabSb**space⇒aabbAb**space⇒aabbab**space This derivation is
• The following CFG is in S → aBB**spaceB → bAA**spaceA → a**spaceB → b
• All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:
• The following CFG is in S → aBB B → bAA A → a B → b
• The …………. is said to be ambiguous if there exist at least one word of its language that can be generated by the different production tree .
• “S →a S”, what is the type of this production?
• Following syntax-directed translation scheme is used with a shift reduction (bottom up) parser that perform the action in braces immediately after a reduction by the corresponding production A —>aB {print “(1)” A —> c {print “1”), B —>Ab {print *2”}. When parser is aaacbbb, then string printed
• Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
• The production Grammar is {S->aSbb,S->abb} is