SYNTAX ANALYSIS
ROLE OF THE PARSER
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
derives in one step
|
|
|
derives in zero or more steps
|
|
|
derives in one or more steps
|
|
|
does not derive
|
Detailed explanation-1: -Detailed Solution The correct answer is “option 1". Hence, the number of steps required to derive the string ((() ()) ()) is 10. There are two types of derivations: 1.
Detailed explanation-2: -We derive strings in the language of a CFG by starting with the start symbol, and repeatedly replacing some variable A by the right side of one of its productions. That is, the “productions for A” are those that have A on the left side of the->. We say A => if A-> is a production. Example: S-> 01; S-> 0S1.
Detailed explanation-3: -The symbol “⟶ “ is read “can be rewritten as.” Rewriting rules are also called production rules or productions, and “⟶ can also be read as “produces.” For example, if we consider strings over the alphabet a, b, c, then the production rule aba⟶cc can be applied to the string abbabacto give the string abbccc.