_____________________________________________________________________________________


Practical exercise

In this guided practical exercise, we will approach the design of an Interpreter with basic resources to review the main concepts of a Recursive Descent Parser. To avoid dealing with a large and complicated grammar, we will restrict the domain to the typical arithmetic expression calculator. This way, we can obtain results with a reduced number of production rules. The practical exercise consists of four main exercises:
  1. A parser for very simple operations.
  2. A calculator for very simple operations (Parser + Semantic Routines).
  3. Inclusion of expressions with parentheses.
  4. Inclusion of operator precedence, and unary signs.

PR 1. Practical exercise (PDF)


Recommended programs


PR 1.1. Developing Lexical Analizers with JFLEX. (URL)

PR 1.2. Developing LALR pasers in Java (CUP). (URL)

PR 1.3. Yacc: Yet Another Compiler-Compiler. (URL)

PR 1.4. A Compact Guide to LEX and YACC. (URL)


Proposed solutions


Exercise 1

PR 2. Exercise 1 - detailed solution (PDF)

PR 3. Exercise 1 - proposed code (PDF)

Exercise 2

PR 4. Exercise 2 - detailed solution (PDF)

PR 5. Exercise 2 - proposed code (PDF)

Exercise 3

PR 6. Exercise 3 - detailed solution (PDF)

PR 7. Exercise 3 - proposed code (PDF)

Exercise 4

PR 8. Exercise 4 - detailed solution (PDF)

PR 9. Exercise 4 - proposed code (PDF)

Last modified: Monday, 16 May 2022, 3:22 PM