Two MadPUG members, Benet Devereux and Davi Post, will be giving talks tonight. Both talks will be no longer than 30 minutes long and there will be time for questions after each.
First we'll hear from Benet. Their talk is titled "Using Python's two-way generators to run nondeterministic tree automata". They described their talk as follows:
If I have trouble understanding something, my first instinct is to code it up. So when I began reading about automata that read trees rather than words, and had a hard time visualizing how that even works, I turned to the Python REPL to see what I could figure out.
PEP 342, implemented in Python 2.5, allows consumers of generators to not only get values back while iterating over the generator, but to pass them in. This seemed like a handy way to simulate runs of non-deterministic automata, since it provides a channel for a consumer to resolve a non-deterministic choice and proceed.
This finally led me to the interesting exercise of writing a generator for in-order tree traversal, becauseI could not find an iterative algorithm for it in any of my algorithms textbooks.
We'll have some time for people to use the rest rooms and ask questions while Davi sets up for his talk.
Davi will explain and demonstrate his universal compiler, Modsplan. It reads modular language specifications, and compiles source code based on those specifications. Currently it works for a subset of C, and for a simple language resembling Python. Modsplan can also parse complex data formats; the specifications serve as complete and readable documentation.
Reminder: Please be considerate and thoughtful when asking questions. Be sure they are actually questions. Suggestions and other comments on techniques should be held until after the meet up.