Handling irregular grammars in Ada
Ada is a language of considerable expressive power that can be exploited for a multitude of purposes. This paper presents how we have taken advantage of the expressive power of Ada to build grammars and use them to parse irregular languages from our problem domain: air traffic control. Rather than using some BNF language and a matching parser generating tool, our design remains completely within the linguistic context of Ada. In return, complexity of the system build is reduced, portability is increased and, last but not least, developers are spared from yet another toolset they have to master.
Unable to display preview. Download preview PDF.
- Alfred Aho, Ravi Sethi, Jeffrey Ullman, Compilers: Principles, Techniques and Tools, Addison Wesley, 1986Google Scholar
- Christian Génillard, “Syntax_Analyser_G: A Multi-Language Syntax Analysis Package,” Ada Letters, vol. XI, no. 1, February 1991, ACM, pp. 52–69.Google Scholar
- Steven Haden, “Lexical_Analyser_G: A Multi-Language Lexical Analysis Package,” Ada Letters, vol. X, no. 1, February 1990, ACM, pp. 131–139.Google Scholar
- M. E. Lesk, E. Schmidt, Lex-A lexical analyzer generator, Bell Laboratories, 1975.Google Scholar
- Rules of the Air & Air Traffic Services, Doc. # 4444, November 21, 1985, International Civil Aviation Organization.Google Scholar