Abstract
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problem, classical grammar flow analysis algorithms, and parsing algorithms.
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
Knuth, D.: A generalization of Dijkstra’s algorithm. Inf. Process. Lett. 6(1), 1–5 (1977)
Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267–305 (1996)
Bar-Hillel, J., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Z. Phonetik. Sprachwiss. Kommunikationforsch. 14, 143–172 (1961)
Aho, A., Ullman, J.: Parsing. The Theory of Parsing, Translation and Compiling, vol. 1. Prentice-Hall, Englewood Cliffs (1972)
Möncke, U., Wilhelm, R.: Iterative algorithms on grammar graphs. In: Schneider, H., Gottler, H. (eds.) Proc. 8th Conf. on Graphtheoretic Concepts in Computer Science (WG’82), pp. 177–194. Hanser Verlag, Hanser (1982)
Möncke, U.: Generierung von Systemen zur Transformation attributierter Operatorbäume; Komponenten des Systems und Mechanismen der Generierung. Diplomarbeit, Universität des Saarlandes, Saarbrücken (1985)
Möncke, U., Wilhelm, R.: Grammar flow analysis. In: Alblas, H., Melichar, B. (eds.) SAGA School 1991. LNCS, vol. 545, pp. 151–186. Springer, Heidelberg (1991)
Wilhelm, R., Maurer, D.: Übersetzerbau. Theorie, Konstruktion, Generierung. Springer, Heidelberg (1992)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th POPL, Los Angeles, CA, pp. 238–252. ACM Press, New York (1977)
Chomsky, N.: Three models for the description of language. IEEE Trans. Information Theory 2(3), 113–124 (1956)
Chomsky, N.: Syntactic Structures. Mouton de Gruyter, Berlin (1957)
Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theoret. Comput. Sci. 277(1—2), 47–103 (2002)
Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: 6th POPL, San Antonio, TX, pp. 269–282. ACM Press, New York (1979)
Cousot, P., Cousot, R.: Constructive versions of Tarski’s fixed point theorems. Pacific J. Math. 82(1), 43–57 (1979)
Ginsburg, S., Rice, G.: Two families of languages related to ALGOL. J. ACM 9, 350–371 (1962)
Schützenberger, M.: On a theorem of R. Jungen. Proc. Amer. Math. Soc. 13, 885–889 (1962)
Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Hays, D.: Introduction to Computational Linguistics. Elsevier, New York (1967)
Younger, D.: Recognition and parsing of context-free languages in time n 3. Inform. and Control 10(2), 609–617 (1967)
Kasami, T.: An efficient recognition and syntax analysis algorithm for context-free languages. Technical report, Air Force Cambridge Research Laboratory, Bedford, MA, US (Aug. 1965)
Ehrenfeucht, A., Päun, G., Rozenberg, G.: Contextual grammars and formal languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 237–293. Springer, Heidelberg (1997)
Boullier, P.: From contextual grammars to range concatenation grammars. ENTCS 53, 41–52 (2001), http://www.elsevier.nl/locate/entcs/volume53.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Cousot, P., Cousot, R. (2007). Grammar Analysis and Parsing by Abstract Interpretation. In: Reps, T., Sagiv, M., Bauer, J. (eds) Program Analysis and Compilation, Theory and Practice. Lecture Notes in Computer Science, vol 4444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71322-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-71322-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71315-9
Online ISBN: 978-3-540-71322-7
eBook Packages: Computer ScienceComputer Science (R0)