Compiler generator based on restarting automata

Abstract

Restarting automata are a very strong theoretical model which can recognize much more than context-free languages in its most general variant. However, for its wider usage in real-world applications it is necessary to fill two gaps: to add semantics - instead of accepting we would like to get a meaning of the input - and to design a tool which for a given restarting automaton in human-readable format generates a program computing the meaning of an input text. The resulting tool is actually a compiler compiler. © 2009 Springer Berlin Heidelberg.