1. FranÇois Barthélemy and Eric Villemonte de la Clergerie. Subsumption-oriented push-down automata and dynamic programming with subsumption. Technical report, INRIA. to appear.
2. A. K. Joshi, L. Levy, and M. Takahashi. Tree adjunct grammars. Journal of the Computer and System Science, 10(1):136–163, Feb 1975.
3. Tadashi Kanamori. Abstract interpretation based on alexander templates. TR-549, ICOT, March 1990.
4. Tadashi Kanamori and Tadashi Kawamura. Abstract interpretation based on OLDT resolution. Research report, ICOT, Tokyo, July 1990.
5. Bernard Lang. Deterministic techniques for efficient non-deterministic parsers. In Proc. of the 2
nd
Colloquium on automata, languages and Programming, pages 255–269, Saarbrücken (Germany), 1974. Springer-Verlag (LNCS 14).