HomeworkLib
Question

Using the following grammar: Expr -> Expr + Term I Expr * Term I Term Term->...

  1. Using the following grammar:

Expr -> Expr + Term I Expr * Term I Term

Term-> 0 I ... I 9 I (Expr)

Draw a parse tree for each of the following:

(a) 5 + 4 * 3

(b) 5 * 4 + 3

  1. using the following grammar:

Expr -> Term+ Expr I Term * Expr I Term

Term -> 0 I …. 9 I (Expr)

Draw a parse tree for each of the following:

(a) 5 + 4 * 3

(b) 5 * 4 + 3

  1. Using the following grammar:

Expr -> Expr + Term I Term

Term-> Term* Factor I Factor

Factor-> 0 I ... I 9 I (Expr)

draw a parse tree for each of the following:

(a) 5 + 4 * 3

(b) 5 * 4 + 3

  1. Explain the main differences between grammars in problems 1, 2 and 3.
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

i am done perfectly and I got perfect answers

Main difference between 3 is all are same output,

Draw the order is different

Some are needed + operation first some are needed * operation first

Some are needed so many steps like factor...etc

Some are needed right most derivation

Some are needed left most derivation...etc

Observe the diagrams you can understand perfectly

Anything doubtful or not understand just comment I will touch with you

Please thumbs-up for my effort

Thank you and all the best

0 0
Add a comment
Know the answer?
Add Answer to:
Using the following grammar: Expr -> Expr + Term I Expr * Term I Term Term->...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 9. Using the following grammar: Expr -> Term + Expr | Term * Expr | Term...

    9. Using the following grammar: Expr -> Term + Expr | Term * Expr | Term Term -> 0| ... | 9 | ( Expr ) draw a parse tree for each of the following (a) 5 + 4 * 3 (b) 5 * 4 + 3

  • 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. 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):

  • The questions in this section are based on the grammar given as the following: prog ->...

    The questions in this section are based on the grammar given as the following: prog -> assign | expr assign -> id = expr expr -> expr + term | expr - term | term term -> factor | factor * term factor -> ( expr ) | id | num id -> A | B | C num -> 0 | 1 | 2 | 3 (2a) What is the associativity of the * operator? (5 points) (2b) What...

  • The questions in this section are based on the grammar given as the following: prog ->...

    The questions in this section are based on the grammar given as the following: prog -> assign | expr assign -> id = expr expr -> expr + term | expr - term | term term -> factor | factor * term factor -> ( expr ) | id | num id -> A | B | C num -> 0 | 1 | 2 | 3 (2a) What is the associativity of the * operator? (5 points) (2b) What...

  • ) Using the following grammar, show a parse tree and a leftmost derivation for the following...

    ) Using the following grammar, show a parse tree and a leftmost derivation for the following sentence (make sure you do not omit parentheses in your derivation):          Grammar          <assign> → <id> = <expr>    <id> → A | B | C    <expr> → <expr> + <term> | <term>    <term> → <term> * <factor> | <factor>    <factor> → (<expr>) | <id> Derive C = (A+B)*(C+A)*(C+B)

  • 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...

  • 3. Consider the following grammar: expr term term tail term-tail-) add-op term term-ail 1 ε term ...

    3. Consider the following grammar: expr term term tail term-tail-) add-op term term-ail 1 ε term → factor factor-tail factor. tain ε factor (expr) id literal add-op → +1 Draw a syntax tree for parsing each of cdf + (a25 + 84), (a25 + 84)*cdf, 84*cdf+ a25, a25+84 cdf a25*84*cdf. Note that a25 and cdf are identifiers and 84 is a literal You are not asked to do the tedious parsing process with stack snapshots. Instead you only need to...

  • 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>)...

  • Consider the following grammar expr- term term_tail term_tail -add_op term term_tail | term - factor factor_tail...

    Consider the following grammar expr- term term_tail term_tail -add_op term term_tail | term - factor factor_tail factor_tail-mult_op factor factor _tail | factor -(expr) |id|literal add_op -+|- mult_op-*|/ Draw syntax tree for parsing each of cdf+(a25+84),(a25+84)*cdf,84*cdf+a25,a25+84*cdf,a25*84*cdf.Note that a25 and cdf are identifiers and 84 is a literal.You are not asked to do the tedious parsing process with stack snapshots.Instead you only need to draw sysntax trees,but you do need to do lexical analysis N.B: I need only lexical analysis for this...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT