Question
below :
R1 : U→IU
R2 : M.x→M.x.x where ːˑ is string concatenation operator. Given this, which of the following holds for
(i) MIUIUIUIUIU
(ii) MIUIUIUIUIUIUIUIU
a.
Either (i) or (ii) but not both of these are valid words.
b.
Both (i) and (ii) are valid words and they take identical number of transformations for the production.
c.
Both (i) and (ii) are valid words but they involve different number of transformations in the production.
d.
None of these
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In a MIU puzzle, either of the letters M, I or U could go as a start symbol. Production rules are given below : R1 : U→IU R2 : M.x→M.x.x where ːˑ is string concatenation...
Similar Questions
Discover Related MCQs
Q. Recursive functions are executed in a
View solution
Q. In an absolute loading scheme which loader function is accomplished by assembler?
View solution
Q. A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar.
S -> xxW[print“1”]
S -> y[print“2”]
W -> S2[print“3”], what is the translation of “x x x x y z z”?
View solution
Q. Synthesized attribute can be easily simulated by a
View solution
Q. There exists a construct which returns a value ‘true’ if the argument subquery is:
View solution
Q. The linker:
View solution
Q. A compiler that runs on one machine and produces code for a different machine is called:
View solution
Q. Any syntactic construct that can be described by a regular expression can also be described by a:
View solution
Q. When a language has the capability to produce new data types, it is said to be:
View solution
Q. An assembly program contains:
View solution
Q. Which of the following are Assembler Directives?
(i) EQU
(ii) ORIGIN
(iii) START
(iv) END
View solution
Q. Assembler program is:
View solution
Q. At the end of parsing,
View solution
Q. Dead-code elimination in machine code optimization refers to:
View solution
Q. A parse tree is an annotated parse tree if:
View solution
Q. In a two pass compiler, during the first pass:
View solution
Q. A single instruction in an assembly language program contains:
View solution
Q. Absolute loader demands that the programmer needs to know the:
View solution
Q. Top-down parsers are predictive parsers, because:
View solution
Q. In the context of compiler design, “reduction in strength” refers to:
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Systems Programming? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
