Automata and languages, automat10
DD2454 Semantics for Programming Languages
There will be two
laboratory assignments (see below as they are
published successively). The labs are to be carried out in teams of at
most two, at home. The lab sessions are only for getting assistance and
presenting the solutions (see instructions on the respective document).
- The first lab assignment
develops a tool for searching for a pattern in a text file. The pattern
is given through a regular expression. Several constructions discussed
in class are used to transform the regular expression into a minimal
DFA, which is then simulated when reading every line of the text file.
The lab assignment is due on 11 February 2010 during the lab session.
- The second lab assignment
develops a tool that automatically checks whether or not a given XML
document conforms to a given DTD specification. The tool achieves this
by constructing a PDA which it then simulates with the XML document as
input.The lab assignment is due on 4 March 2010 during the lab session.