Theory of Computing > QUESTIONS & ANSWERS > CS 421 Theory of computing CS421 - HW3A (based on Week 8 and 9) | California State University, San M (All)

CS 421 Theory of computing CS421 - HW3A (based on Week 8 and 9) | California State University, San Marcos

Document Content and Description Below

California State University, San Marcos CS 421 Theory of computing CS421 - Yoshii – HW3A (based on Week 8 and 9) Parsing Prep and LL(1) - Always Use Black for your answers DUE: Week 10 Frid ... ay before midnight TOTAL: 20 pts ** Name: ** Qian Zhu ------------------------------------------------------------------------ From Week 8 Notes: Operator Precedence and Associativity Questions Be sure to read the notes first. [2pts per prompt = 6 pts] ------------------------------------------------------------------------ Operators are #, @ and % where # has the highest precedence % has the lowest. No parenthesized parts. They are all RIGHT associative. a) Using non-terminals <E> for expression, <T> for term and <F> for factor and the only other terminal is a, please write production rules for <E>, <T> and <F>. b) Using the set of rules from (a), please draw the parse tree for c) Using the set of rules from (a), please draw the parse tree for --------------------------------------------------------------------- Table Driven LL(1) Parser From week9b [14 pts] ----------------------------------------------------------------------- ** State of the program: <Not Finished> Graded on: Correctness: Comments: Test results: Following the instructions: 1. Submit the source code file ll1.cpp with comments 2. Submit the test results (Test.txt script or screen dump) from Empress with lines for compiling the file!. Using the algorithm in week9b notes, the program must parse using LL(1) Table Driven Parser. [Show More]

Last updated: 7 months ago

Preview 1 out of 3 pages

Buy Now

Instant download

We Accept: