Equivalent Transformations and Regularization in Context-Free Grammars
By: Ludmila Fedorchenko and Sergey Baranov
References
- 1. Aho, A., R. Sethi, J. Ullman. Compilers: Principles, Techniques and Tools. Addison- Wesley, 1986.
- 2. Fedorchenk o, L. An Algorithm of Parsing Languages Generated with R-Grammars. – In: Algorithms and Systems for Research Automation. Moscow, Nauka, 2008, 15-20 (in Russian).
- 3. Fedorchenko, L. Syntax Graph Transformations in the System SynGT and Regularization of Grammars. – In: International Multi- Conference on Advanced Computer Systems (ACS-CISIM'2004), 14-16 June 2004, Elk, Poland.
- 4. Fedorchenko, L. On Regularization of Context-Free Grammars. – Izvestiya Vuzov. Priborostroyeniye, Vol., 2006, No 11, 50-54 (in Russian).
- 5. Fedorchenko, L. Regularization of Context-Free Grammars. LAP LAMBERT Academic Publishing, Saarbrucken, 2011.
- 6. Baranov, S., C. Lavarenne. Open C Compiler in Forth. – In: EuroForth'95, 27-29 October 1995, Schloss Dagstuhl.
- 7. Bison – GNU Parser Generator.
- 8. The comp.compilers newsgroup.
- 9
- 10. Lex – A Lexical Analyzer Generator.
- 11. ANTLR (A Nother Tool for Language Recognition).
- 12. Syntax: An Advanced Technology of Directed Syntax Processing (in Russian).
- 13. Win Flex-Bison.
- 14. Martynenko, B. K. Regular Languages and CF Grammars. – Computer Tools in Education, Vol., 2012, 14-20 (in Russian).
DOI: https://doi.org/10.1515/cait-2014-0003 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702 (formerly 1314-4081)
Language: English
Page range: 29 - 44
Published on: Jan 31, 2015
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Related subjects:
© 2015 Ludmila Fedorchenko, Sergey Baranov, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.