Homework Answers
Parse Tree: -------------Leftmost derivation: ---------------------- <asign> -> <id> = <expr> -> B = <expr> -> B = <id> * <expr> -> B = C * <expr> -> B = C * (<expr>) -> B = C * (<id> * <expr>) -> B = C * (A * <expr>) -> B = C * (A * (<expr>)) -> B = C * (A * (<id> + <expr>)) -> B = C * (A * (B + <expr>)) -> B = C * (A * (B + <id>)) -> B = C * (A * (B + C))
Leftmost derivation:
----------------------
<asign>
-> <id> = <expr>
-> B = <expr>
-> B = <id> * <expr>
-> B = C * <expr>
-> B = C * (<expr>)
-> B = C * (<id> * <expr>)
-> B = C * (A * <expr>)
-> B = C * (A * (<expr>))
-> B = C * (A * (<id> + <expr>))
-> B = C * (A * (B + <expr>))
-> B = C * (A * (B + <id>))
-> B = C * (A * (B + C))
Add Answer to:
- Using the grammar in Example 3.2, show a parse tree and a leftmost derivation for...
3. Using the grammar below, show a parse tree and a leftmost derivation for the statement....
3. Using the grammar below, show a parse tree and a leftmost derivation for the statement. A = ( A + (B)) * C assign <idxpr expr>? <expr> <term> term <term factor factor (<expr>) l <term I <factor l <id> 4. Prove that the following grammar is ambiguous (Give sentence that has two parse trees, and show the parse trees):
Use the grammar given below and show a parse tree and a leftmost derivation for each...
Use the grammar given below and show a parse tree and a leftmost
derivation for each of
the following statements.
1. A = A * (B + (C * A))
2. B = C * (A * C + B)
3. A = A * (B + (C))
<assign> → <id> <expr> = <expr> → <id> + <expr> kid<expr> <expr>) ids
1) Using the grammar in Example 3.2, show a completed parse tree for each of the...
1) Using the grammar in Example 3.2, show a completed
parse tree for each of the following statements: a) A = A * (B + (C
* A)) b) A = A * (B + (C))
2) Using the original grammar in Example 3.4, show a
completed parse tree for the statement: A = B + C + A
A Grammar for Simple Assignment Statements PLE 3.2 cassign><id> <expr> cidA BIC «ехpг» — sid + <ехpг» id cexpr> ( <expr>)...
6. (8 pts) Using grammar below show a Parse tree and leftmost derivation for a). A...
6. (8 pts) Using grammar below show a Parse tree and leftmost derivation for a). A = A * (B+C) <assign> à<id> = <expr> <id> à A | B|C <expr>à <expr> + <term> | <term> <term> à <term> * <factor> |<factor> <factor> à ( <expr> ) |<id>
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]...
Using the grammar below: <program> → begin <stmt_list> end <stmt_list> <stmt> | <stmt>; <stmt_list> <stmt> <var>...
Using the grammar below: <program> → begin <stmt_list> end <stmt_list> <stmt> | <stmt>; <stmt_list> <stmt> <var> = <expression> <var> → ABC <expression> <var> + <var> | <var> - <var> | <var> 1) show a leftmost derivation and draw a parse tree for each of the statements below: (1) begin A=A-B; B=C; C=A end (2) begin A=B+C; C=C+B end 2) try a rightmost derivation and draw a parse tree for each of the statements in Q1).
Consider the following grammar (G1) for simple assignment statements. (The symbols in double quotation marks are...
Consider the following grammar (G1) for simple assignment statements. (The symbols in double quotation marks are terminal symbols.) assign → id “ = ” expr id → “A” | “B” | “C” expr → expr “ + ” expr | expr “ ∗ ” expr | “(” expr “)” | id a) Give a (leftmost) derivation for string A = B ∗ A + C. b) Give the parse tree for string A = B ∗ A + C. c)...
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.
2. Consider the following grammar: <assign> à <id> = <expr>
2. Consider the following grammar: <assign> à <id> = <expr> <id> à A | B | C <expr> à <id> + <expr> | <id> * <expr> | ( <expr> ) | <id> Show a parse tree and leftmost derivation for the following statements: (a) A = ( A + B ) * C (b) A = A * ( B + C ) 3. [10 Points] Show that the following grammar is...
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.
3. Using the grammar below, show a parse tree and a leftmost derivation for the statement. A = ( A + (B)) * C assign <idxpr expr>? <expr> <term> term <term factor factor (<expr>) l <term I <factor l <id> 4. Prove that the following grammar is ambiguous (Give sentence that has two parse trees, and show the parse trees):
Use the grammar given below and show a parse tree and a leftmost
derivation for each of
the following statements.
1. A = A * (B + (C * A))
2. B = C * (A * C + B)
3. A = A * (B + (C))
<assign> → <id> <expr> = <expr> → <id> + <expr> kid<expr> <expr>) ids
1) Using the grammar in Example 3.2, show a completed
parse tree for each of the following statements: a) A = A * (B + (C
* A)) b) A = A * (B + (C))
2) Using the original grammar in Example 3.4, show a
completed parse tree for the statement: A = B + C + A
A Grammar for Simple Assignment Statements PLE 3.2 cassign><id> <expr> cidA BIC «ехpг» — sid + <ехpг» id cexpr> ( <expr>)...
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]...
Using the grammar below: <program> → begin <stmt_list> end <stmt_list> <stmt> | <stmt>; <stmt_list> <stmt> <var> = <expression> <var> → ABC <expression> <var> + <var> | <var> - <var> | <var> 1) show a leftmost derivation and draw a parse tree for each of the statements below: (1) begin A=A-B; B=C; C=A end (2) begin A=B+C; C=C+B end 2) try a rightmost derivation and draw a parse tree for each of the statements in Q1).
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.
Most questions answered within 3 hours.
-
A 6.5 cm diameter ball has a terminal speed of 22 m/s. What is
the ball's...
asked 2 minutes ago -
Name two areas of the human body with the highest concentration
of lymph nodes and speculate...
asked 6 minutes ago -
Angel Corporation has $10,000,000 of
8.0% 25 year bonds dated May 1, 2018 with interest payable...
asked 41 minutes ago -
7.
________ involves individuals trading goods they already have or
providing services in exchange for something...
asked 45 minutes ago -
Share your research problem. What databases did you search as
you gathered evidence to support your...
asked 45 minutes ago -
what process occurs to form microspores and megaspores in flowering
plants?
asked 52 minutes ago -
C++
I need to use the function getData to put in all my data using
arrays....
asked 52 minutes ago -
A block is hung by a string from the inside roof of a van. When
the...
asked 59 minutes ago -
Do you think companies should not go for long term debt in their
capital structure to...
asked 1 hour ago -
I create an address book where the user enters the name, phone
and email in the...
asked 1 hour ago -
The production capacity for acrylonitrile
(C3H3N) in the United States exceeds 2
million pounds per year....
asked 1 hour ago -
explain and comment out your answer
43. How many address lines are required to address a...
asked 1 hour ago