Parsing, Baby!
27 January 2004, the wee hours
Our compiler seems to be parsing stuff now. We need to do some serious testing to make sure this is indeed the case, but I am hoping that there are no problems. Kumar is supposed to be working on a testing document now.
I used a program called ilalr to determine the states of a DFA that we could use to parse the context-free grammar. I had to write a program that would convert the output of the program into code I could use to make a parse table. The parser implemented is an LR-parser, which people usually refer to as a bottom up parser because of the way the parse tree gets built.
Kumar and I still have to write the code needed to produce a basic symbol table, and I think we need to improve our error handling. Hopefully that isn’t too much work.