60) Consider the grammar
S ---> PQ | SQ | PS
P ---> x
Q--> y
To get a string of n terminals, the number of productions to be used is

61) What is the highest type number which can be applied to the following grammar ?
S —> Aa, A —> Ba, B —> abc

62) 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

63) Which of the following is complement of a?

64) If nL can be recognized by a multitape TM with time complexity f, then L can be recognized by a one-tape machine with time complexity DSD