I started today with a chess rating of 1583 and maintained a 1573. I wrote my first
flex and
bison parsers for TL-Delta language (this was an assignment in one of my classes). I mentioned to the professor that I would like to generate executables from the TL-Delta grammars, the executables would either be pseudo-Turing Machines or Linear Bounded Automata (LBA). Dr. Hedrick didn't think such a task could be finished before the end of semester. *grin* I finished in one day, two weeks before the end of the semester. The whole process, including defining the TL-Delta grammar in Bison and configuring flex rules to help bison parse tokens and defining a second flex grammar for producing a compilable function in C took 8-10 hours of the course of three days. The great part is the Bison code is only a grammar acceptor, I didn't need semantic interpretation to produce the output. Once a given TL-Delta grammar has been verified with my Bison grammar, I run the TL-Delta grammar through the second flex grammar which generates the C code by substituting TL-Delta tokens with legitimate C code. The output function is then included into C wrapper which has all the needed boilerplate code to take command line inputs and run the TM code - which is still not guaranteed to halt. I'm going to throw together a Makefile to automate the process, and upload it to the projects page.
