Replacing parser technology
===========================
Your project is to replace Pleasant's recursive descent parser (found
in the accompanying tarfile in language-COP4020/compiler/parser.c)
with a parser generated by the Lemon parser generator.
While the canonical reference is the recursive descent parser in the
tar file distributed with this assignment (it's in
language-COP4020/compiler/parser.c), a rough BNF-like grammar for
Pleasant is also given below:
"BNF-like" grammar for Pleasant
===============================
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
29 | 30 | 1 | 2 | 3 | 4 | 5 |
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 | 1 | 2 |