Question

Question 1 Consider the following BNF grammar: Not complete Marked out of 3.00 p Flag question <letter> ::= "a" | "b" | "C" | "d" | "e" | "F" | "g" | "h" | "1" ";" | "K" | "1" | "m" | "n" | "0" | "p" | "q" | "r" | "S" | "t" || "u" | "V" | "W" | "x" | "y" | "z" <digit> ::= "O" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" <ls> ::= <letterxletter>|<letter>letterxletter>|<letterx letterx letterxletter> <ds> ::= <digitxdigitx digit> <goal-symbol> ::= <ls X ds> In the answer box below, write THREE strings that each parse to this grammar's <goal-symbol>. Write each string onto a line of its own. Each string must have a different length, and the string in each line must be longer than the string in the line above it.

Answer 1

Answer:-------------

THREE strings that each parse to this grammar's <goal-symbol>:-----------
By Using Right Most Derivation:(RMD) :-------------

First String:-----
<goal-symbol> ===
=> <ls><ds> ---------------------------------// by, <goal-symbol> => <ls><ds>
=> <ls><digit><digit><digit> ------------// by <ds> => <digit><digit><digit>
=> <ls> <digit><digit>"0" -----------// by, <digit> => "0"
=> <ls> <digit>"1" "0 ----------------// by, <digit> => "1"
=> <ls> "2" "1" "0" ------------------// by, <digit> => "2"
=> <letter><letter> "2" "1" "0" -------------------// by, <ls> <letter><letter>
=> <letter>"a" "2" "1" "0" ------------------------// <letter> => "a"
=> "b" "a" "2" "1" "0" -----------------------------//  <letter> => "b"
=> "b" "a" "2" "1" "0"

Second String:------
<goal-symbol> ===
=> <ls><ds> ---------------------------------// by, <goal-symbol> => <ls><ds>
=> <ls><digit><digit><digit> ------------// by <ds> => <digit><digit><digit>
=> <ls> <digit><digit>"0" -----------// by, <digit> => "0"
=> <ls> <digit>"1" "0 ----------------// by, <digit> => "1"
=> <ls> "2" "1" "0" ------------------// by, <digit> => "2"
=> <letter><letter><letter> "2" "1" "0" -------------------// by, <ls> <letter><letter><letter>
=> <letter><letter>"a" "2" "1" "0" ------------------------// <letter> => "a"
=> <letter>"b" "a" "2" "1" "0" -----------------------------//  <letter> => "b"
=> "c" "b" "a" "2" "1" "0"  -----------------------------//  <letter> => "c"
=> "c" "b" "a" "2" "1" "0"

Third String:------
<goal-symbol> ===
=> <ls><ds> ---------------------------------// by, <goal-symbol> => <ls><ds>
=> <ls><digit><digit><digit> ------------// by <ds> => <digit><digit><digit>
=> <ls> <digit><digit>"0" -----------// by, <digit> => "0"
=> <ls> <digit>"1" "0 ----------------// by, <digit> => "1"
=> <ls> "2" "1" "0" ------------------// by, <digit> => "2"
=> <letter><letter><letter><letter> "2" "1" "0" -------------------// by, <ls> <letter><letter><letter><letter>
=> <letter><letter> <letter>"a" "2" "1" "0" ------------------------// <letter> => "a"
=> <letter><letter> "b" "a" "2" "1" "0" -----------------------------//  <letter> => "b"
=> <letter> "c" "b" "a" "2" "1" "0"  -----------------------------//  <letter> => "c"
=> "d" "c" "b" "a" "2" "1" "0" ----------------------------------- // <letter> => "d"
​​​​​​​=> "d" "c" "b" "a" "2" "1" "0"