Given the following BNF: S → N+S | N N → 0 | 1 | 2...
Given the following BNF: S → N+S | N N → 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 For each sentence, do two things: draw a parse tree, and write out a leftmost derivation. Don't skip any steps! 2+3 4+5+6
Homework Answers
Ans:
Left Most Derivation:
It means Everytime the left most non terminal is derived until we get the desired string.
Here,
Non terminals: S,N
Terminals: 0,1,2,3,4,5,6,7,8,9
Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the...
Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the associativity of each of the operators? What is precedence of the operators? Show a leftmost derivation and parse tree for the following sentence: b) c) A-A(B(C A)) d) Rewrite the BNF grammar above to give precedence over and force to be right associative.
Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the...
Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the associativity of each of the operators? What is precedence of the operators? Show a leftmost derivation and parse tree for the following sentence: b) c) A-A(B(C A)) d) Rewrite the BNF grammar above to give precedence over and force to be right associative.
26 *4+5 (similar.to week 4 3. For expression MyvarA 3.1 Define its BNF grammar (1pt) exercise...
26 *4+5 (similar.to week 4 3. For expression MyvarA 3.1 Define its BNF grammar (1pt) exercise 6 & week 5 ppt beginning example) 3.2 Find out its BNF left-most derivation (1pt) 3.3 Draw its parse tree (1pt) 3.4 Draw its abstract syntax tree (1pt)
1. Write a BNF description of the logical expressions and the relational expressions in C++. Make...
1. Write a BNF description of the logical expressions and the relational expressions in C++. Make sure that the BNF reflects the order of precedence of the operators, as well as, the associativity rules. 2. Using the BNF rules in 1., give a rightmost derivation and show a parse tree for the expression below. 3. Prove that the following grammar is ambiguous and rewrite the grammar to remove ambiguity «newexp> → «newexp> @ <newexp> ulvl w I <other> <other> →
You are given the following context free grammar in BNF format. 1 <expression> ::= <term> |...
You are given the following context free grammar in BNF format. 1 <expression> ::= <term> | <expression> "+" <term> 2 <term> ::= <factor> | <term> "*" <factor> 3 <factor> ::= <constant> | <variable> | "(" <expression> ")" 4 <variable> ::= "x" | "y" | "z" 5 <constant> ::= <digit> | <digit> <constant> 6 <digit> ::= "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" a) Show how the expression 4...
1. In a language, each sentence is a string starting with a capital letter followed by...
1. In a language, each sentence is a string starting with a capital letter followed by two or more small letters and ending with three or more digits. Example sentences are Abc001, Zyxw9876 etc. a) Write a BNF grammar for the language. b) Show the derivation and the parse tree of the string Test3501. 2. Augment the following BNF to write an attribute grammar. Assume the only possible variable types are integer and float. The language rules are as follows:...
Question 1 Consider the following BNF grammar: Not complete Marked out of 3.00 p Flag 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" |...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
Question 3: Given the following grammar: assign → id := expr expr → expr + term \ term term -term *factor lfactor factor-(expr) id Using the above grammar, show a leftmost derivation (first five step...
Question 3: Given the following grammar: assign → id := expr expr → expr + term \ term term -term *factor lfactor factor-(expr) id Using the above grammar, show a leftmost derivation (first five steps) for the following assignment statement: A ((A B)+ C) a. [3 marks] b. Using the above grammar, show a rightmost derivation (first five steps) for the following assignment statement: A:-A+B+C)+A [3 marks] Draw the abstract syntax tree for each of the above statements [4 marks]...
3. Consider the following BNF for arithmetic expressions: <expression> ::= <term> <term>+ <expression> | <term> -...
3. Consider the following BNF for arithmetic expressions: <expression> ::= <term> <term>+ <expression> | <term> - <expression> <term> ::= <factor> | <factor> * <term> | <factor> I <term> <factor> ::= <constant> (<expression>) <constant ::= 0|1|2|3|4|5|6789 a) Show the expression tree of the following expression: 8/7*5/6-6/4/2-7*(5+2). b) Give the value of this expression. c) Same question as (a), if the BNF were <expression> ::= <term> | <expression>+ <term> | <expression> - <term> <term> ::= <factor> | <term>*<factor> | <term> / <factor>...
Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the associativity of each of the operators? What is precedence of the operators? Show a leftmost derivation and parse tree for the following sentence: b) c) A-A(B(C A)) d) Rewrite the BNF grammar above to give precedence over and force to be right associative.
Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the associativity of each of the operators? What is precedence of the operators? Show a leftmost derivation and parse tree for the following sentence: b) c) A-A(B(C A)) d) Rewrite the BNF grammar above to give precedence over and force to be right associative.
26 *4+5 (similar.to week 4 3. For expression MyvarA 3.1 Define its BNF grammar (1pt) exercise 6 & week 5 ppt beginning example) 3.2 Find out its BNF left-most derivation (1pt) 3.3 Draw its parse tree (1pt) 3.4 Draw its abstract syntax tree (1pt)
1. Write a BNF description of the logical expressions and the relational expressions in C++. Make sure that the BNF reflects the order of precedence of the operators, as well as, the associativity rules. 2. Using the BNF rules in 1., give a rightmost derivation and show a parse tree for the expression below. 3. Prove that the following grammar is ambiguous and rewrite the grammar to remove ambiguity «newexp> → «newexp> @ <newexp> ulvl w I <other> <other> →
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" |...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
Question 3: Given the following grammar: assign → id := expr expr → expr + term \ term term -term *factor lfactor factor-(expr) id Using the above grammar, show a leftmost derivation (first five steps) for the following assignment statement: A ((A B)+ C) a. [3 marks] b. Using the above grammar, show a rightmost derivation (first five steps) for the following assignment statement: A:-A+B+C)+A [3 marks] Draw the abstract syntax tree for each of the above statements [4 marks]...
3. Consider the following BNF for arithmetic expressions: <expression> ::= <term> <term>+ <expression> | <term> - <expression> <term> ::= <factor> | <factor> * <term> | <factor> I <term> <factor> ::= <constant> (<expression>) <constant ::= 0|1|2|3|4|5|6789 a) Show the expression tree of the following expression: 8/7*5/6-6/4/2-7*(5+2). b) Give the value of this expression. c) Same question as (a), if the BNF were <expression> ::= <term> | <expression>+ <term> | <expression> - <term> <term> ::= <factor> | <term>*<factor> | <term> / <factor>...
Most questions answered within 3 hours.
-
Researchers measured the data speeds for a particular smartphone
carrier at 50 airports. The highest speed...
asked 15 minutes ago -
Ingraham Inc. currently has $880,000 in accounts receivable, and
its days sales outstanding (DSO) is 47...
asked 16 minutes ago -
Look at sample problem 19.6 in the 8th ed Silberberg book.
Enter your answers in scientific...
asked 36 minutes ago -
A long straight wire carries a current of 5.00 A at a distance r from the...
asked 37 minutes ago -
A 125
g baseball is thrown at a speed of 127ft/sec at a batter, the ball...
asked 43 minutes ago -
If you have an eta squared of .34 and used a
between-subjects design, what does that...
asked 50 minutes ago -
*Healthcare Adminstration*
Scutchfield and Keck's Principles of Public Health Practice
4th edition
What are the differences...
asked 55 minutes ago -
Find the complete optimal solution to this linear programming
problem. Max 5x + 3y s.t. 2x...
asked 1 hour ago -
The pH of an acetate buffer was determined to be 4.76. Then, a
few drops of...
asked 1 hour ago -
a sample of size 1500 is used to find a confidence
interval for the percentage of...
asked 1 hour ago -
Explain in detail the differences between qualitative and
quantitative forecasts. Include at least two examples of...
asked 1 hour ago -
Differentiate between response time and throughput.
Explain how the physical design of a database influences
performance...
asked 1 hour ago