HomeworkLib
Question

Question 1. (15 points) Consider the following LL (1) grammar with starting symbol S s→(ST) F → id F → num a) Compute the First and Follow sets of all non-terminals (5 points) b) Construct the LL (1) parsing table for the grammar (5 points) c) Show step-by-step (content of stack and input string, as well as the production taken) how the following string is parsed: ((20+30 + a)) (5 points)

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 d au mum first C - , E first CE) = Şid, nu m Sider S→ follow CT) = CF)2 Follow (F): first (T)こ{t.e Substitute 6) CST) T7 LL Parsimg ta6feInput af ression b〉 C20 t30+ Ou Put Stack CST 26130 match C mateh 26 match Fonum match. num match id 20 t 30+amatcん) matcん、 ー/given Ex..pression AJ Accet te(

0 0
Add a comment
Know the answer?
Add Answer to:
Question 1. (15 points) Consider the following LL (1) grammar with starting symbol S s→(ST) F...
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

  • 2. Consider the following context free grammar with terminals (), +, id, num, and starting symbol...

    2. Consider the following context free grammar with terminals (), +, id, num, and starting symbol S. S (ST) F-id Fnum a. Compute the first and follow set of all non-terminals (use recursion or iteration, show all the steps) Show step-by-step (the parsing tree) how the following program is parsed: (num+num+id)) b.

  • Consider the following LL(1) grammar with terminals (, ), +, id, num, and starting symbol S....

    Consider the following LL(1) grammar with terminals (, ), +, id, num, and starting symbol S. Compute the first and follow set of all the nonterminals. S → (ST) F→id

  • (10] Eliminate left recursion from the grammar A Ba |Aa c B Bb | Ab 1...

    (10] Eliminate left recursion from the grammar A Ba |Aa c B Bb | Ab 1 d A Ad IB A BA ASJAE Consider the following grammar G: S'S S (S)S|e fa) (10] Construct the collection of the sets of LR(0) items (b) [5] When constructing the action table of SLR parser of G what are the rules to determine the parsing actions? That is, what is the rule for a shift action at state /? What is the rule...

  • Name: 3. (10 points) Given grammar: <program> → <stmts> Page: 2 <term> → <var> 1 const...

    Name: 3. (10 points) Given grammar: <program> → <stmts> Page: 2 <term> → <var> 1 const 1), write down derivation of: c-5+a 2) What are terminals and what are non-terminals in the grammar? Show a complete parse, including the parse stack contents, input string, and action for the string: id - id + id, using the grammar and parse table below. (10 points) 4. Grammar State id S4 4. T F 5. F (E) R2 S7 R4 R4 R2İR2 Parse...

  • Consider the following grammar: (//some alternative rules are listed on separate lines without using symbol |):...

    Consider the following grammar: (//some alternative rules are listed on separate lines without using symbol |): stmt −> assignment −> subr call assignment −> id := expr subr call −> id ( arg list ) expr −> primary expr tail expr tail −> op expr −> ε primary −> id −> subr call −> ( expr ) op −> + | - | * | / arg list −> expr args tail args tail −> , arg list −> ε...

  • For the following grammar (7 points) 1. B - Ba|A S - ABb A - Aba...

    For the following grammar (7 points) 1. B - Ba|A S - ABb A - Aba |A to find a grammar without A productions that generates the same language, we first identify non-terminals that drive A. These non-terminals are: A and B. Then from S - ABb, we construct S from A - Aba, we construct A - from B - Ba, we construct B - So, the grammar without A that generates the same language is:

  • Please help me with the coding for LL(1)!! The given grammar was: P → PL |...

    Please help me with the coding for LL(1)!! The given grammar was: P → PL | L L → N; | M; | C N → print E M → print "W" W → TW | ε C → if E {P} | if E {P} else {P} E → (EOE) | V (note: this has a variable O) O → + | - | * V → 0 | 1 | 2 | 3 (note: this has a terminal...

  • Given the following grammar, FIRST and FOLLOW sets and LL Parser table, trace the parse of...

    Given the following grammar, FIRST and FOLLOW sets and LL Parser table, trace the parse of the string “fd xcor + ycor rt ycor” and draw the parse tree. FIRST(S) = FIRST(B) = FIRST(D) = { fd, rt } FIRST(A) = { fd, rt, ε } FIRST(E) = { xcor, ycor } FIRST(F) = { +, -, ε } FOLLOW(S) = { $ }                                      S --> BA FOLLOW(A) = { $ }                                      A --> BA | ε FOLLOW(B) = {...

  • 10 pt) Consider the following grammar where S is the start variable » terminals: x, y,...

    10 pt) Consider the following grammar where S is the start variable » terminals: x, y, z,t,,* non-terminals: El T, F, V * start symbol: E production rules (a) (4 pt) What is the associativity of the operators+,, * and/ explain why. (b) (3 pt) What is the precedence of , and / explain why (c) (3 pt) Given a parse tree F * T 2 2 Explain how the value of the string is generated

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