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
A) 0202021
B) 1202020
C) 1020202
D) None of these
Correct Answer:
Verified
Q34: If L1 and L2 are context free
Q35: The logic of pumping lemma is a
Q36: For two regular languages L1 = (a
Q37: Pumping lemma is generally used for proving
Q38: What is the highest type number which
Q40: FSM can recognize
A)Any grammar
B)Only CG
C)Both (a) and
Q41: Basic limitation of FSM is that it
A)Cannot
Q42: Which of the following are decidable?
1) Whether
Q43: If L and L¯ are recursively enumerable,
Q44: Which of the following problems is undecidable?
A)Membership
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents