Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alfred Aho, Ravi Sethi, Jeffrey Ullman, Compilers: Principles, Techniques and Tools, Addison Wesley, 1986
Christian Génillard, “Syntax_Analyser_G: A Multi-Language Syntax Analysis Package,” Ada Letters, vol. XI, no. 1, February 1991, ACM, pp. 52–69.
Steven Haden, “Lexical_Analyser_G: A Multi-Language Lexical Analysis Package,” Ada Letters, vol. X, no. 1, February 1990, ACM, pp. 131–139.
M. E. Lesk, E. Schmidt, Lex-A lexical analyzer generator, Bell Laboratories, 1975.
Rules of the Air & Air Traffic Services, Doc. # 4444, November 21, 1985, International Civil Aviation Organization.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sotirovski, D., Kruchten, P. (1996). Handling irregular grammars in Ada. In: Strohmeier, A. (eds) Reliable Software Technologies — Ada-Europe '96. Ada-Europe 1996. Lecture Notes in Computer Science, vol 1088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013498
Download citation
DOI: https://doi.org/10.1007/BFb0013498
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61317-6
Online ISBN: 978-3-540-68457-2
eBook Packages: Springer Book Archive