Compiler-Design
October 10, 2023UGC NET CS 2009 Dec-Paper-2
October 10, 2023UGC NET CS 2009 Dec-Paper-2
|
Question 5
|
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 operator. Given this, which of the following holds for
(i) MIUIUIUIUIU
(ii) MIUIUIUIUIUIUIUIU
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
|
Either (i) or (ii) but not both of these are valid words.
|
|
|
Both (i) and (ii) are valid words and they take identical number of transformations for the production.
|
|
|
Both (i) and (ii) are valid words but they involve different number of transformations in the production.
|
|
|
None of these
|
Question 5 Explanation:
(i) string-> MIUIUIUIUIU
It has M (5 times ) IU
So start with MIU
Production 2 says: M.x-> M.x.x
So
MU-> MUU again using it
MUU-> MUUU -> MUUUU ->MUUUUU
Now using prod 1: Last U-> IU
MUUUUU -> MIUUUUU
MIUUUUU -> MIUIUUUU
MIUIUUU —————-> MIUIUIUIUIU
It has M (5 times ) IU
So start with MIU
Production 2 says: M.x-> M.x.x
So
MU-> MUU again using it
MUU-> MUUU -> MUUUU ->MUUUUU
Now using prod 1: Last U-> IU
MUUUUU -> MIUUUUU
MIUUUUU -> MIUIUUUU
MIUIUUU —————-> MIUIUIUIUIU
Correct Answer: C
Question 5 Explanation:
(i) string-> MIUIUIUIUIU
It has M (5 times ) IU
So start with MIU
Production 2 says: M.x-> M.x.x
So
MU-> MUU again using it
MUU-> MUUU -> MUUUU ->MUUUUU
Now using prod 1: Last U-> IU
MUUUUU -> MIUUUUU
MIUUUUU -> MIUIUUUU
MIUIUUU —————-> MIUIUIUIUIU
It has M (5 times ) IU
So start with MIU
Production 2 says: M.x-> M.x.x
So
MU-> MUU again using it
MUU-> MUUU -> MUUUU ->MUUUUU
Now using prod 1: Last U-> IU
MUUUUU -> MIUUUUU
MIUUUUU -> MIUIUUUU
MIUIUUU —————-> MIUIUIUIUIU
Subscribe
Login
0 Comments