McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Theory of Computation
→
Unit 2
→
“S →a S”, what is the type of this produ...
Q.
“S →a S”, what is the type of this production?
A.
Type 0
B.
Type 1
C.
Type 2
D.
Type 3
Answer» D. Type 3
3.8k
0
Do you find this helpful?
26
View all MCQs in
Theory of Computation
Discussion
No comments yet
Login to comment
Related MCQs
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 .
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
Left hand side of a production in CFG consists of:
Type-1 Grammar is known as_____________
A→abA a type __________productions
What is the highest type number which can be applied to the following grammar? S —>Aa, A —> Ba, B —>abc