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.
This work was partially supported by the program ‘Information Society’ under project 1ET100300517.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Otto, F.: Restarting automata. In: Esik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Berlin (2006)
Mráz, F., Otto, F., Plátek, M.: Learning analysis by reduction from positive data. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS, vol. 4201, pp. 125–136. Springer, Heidelberg (2006)
Donnely, C., Stallman, R.: Bison, http://www.gnu.org/software/bison/manual/html_mono/bison.html
Procházka, J.: Vizualizace molekul popsaných v ženevském názvosloví: Bakalářská práce. Univerzita Karlova, Matematicko-fyzikální fakulta, Praha (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Procházka, J. (2009). Compiler Generator Based on Restarting Automata. In: Maneth, S. (eds) Implementation and Application of Automata. CIAA 2009. Lecture Notes in Computer Science, vol 5642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02979-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-02979-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02978-3
Online ISBN: 978-3-642-02979-0
eBook Packages: Computer ScienceComputer Science (R0)