COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
canonical
|
|
|
RMD
|
|
|
LMD
|
|
|
Low
|
Detailed explanation-1: -2. Rightmost Derivation-The process of deriving a string by expanding the rightmost non-terminal at each step is called as rightmost derivation. The geometrical representation of rightmost derivation is called as a rightmost derivation tree.
Detailed explanation-2: -Derive the string"00101” for left most derivation (LMD) and right most derivation (RMD) using context free grammar (CFG).
Detailed explanation-3: -Leftmost and Rightmost Derivation of a String Leftmost derivation − A leftmost derivation is obtained by applying production to the leftmost variable in each step. Rightmost derivation − A rightmost derivation is obtained by applying production to the rightmost variable in each step.
Detailed explanation-4: -In automata, derivation is a process of deriving a string. Parse tree or Derivation tree is the geometrical representation of a derivation. Leftmost Derivation and Rightmost Derivation are the two types of derivation.