Abstract
Logic programs share with context-free grammars a strong reliance on well-formedness conditions. Their proof procedures can be viewed as a generalization of context-free parsing. In particular, definite clause grammars can be interpreted as an extension of the classic context-free formalism where the notion of finite set of non-terminal symbols is generalized to a possibly infinite domain of directed graphs. In this case, standard polynomial parsing methods may no longer be applicable as they can lead to gross ineficiency or even non-termination for the algorithms. We present a proposal to avoid these drawbacks, focusing on two aspects: avoiding limitations on the parsing process, and extending the unification to composed terms without overload for non-cyclic structures.
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
Bresnan, J., Kaplan, T.: Lexical-Functional Grammar: a formal system for grammatical representation. In J. Bresnan (ed.): the Mental Representation of Grammatical Relations (1982) 173–281. MIT Press
De la Clergerie, E.: Automates à piles et programmation dynamique. DyALog: une application à la Programmation en Logique. PhD thesis. University of Paris 7 (1993)
Filgueiras, M.: A PROLOG interpreter working with infinite terms. In Implementations ofPROLOG (1985)
Haridi, S., Sahlin, D.:. Efficient implementation of unification of cyclic structures. In Implementations ofPROLOG (1985)
Lang, B.: Towards a uniform formal framework for parsing. In M. Tomita (ed.): Current Issues in Parsing Technology (1991) 153–171. Kluwer Academic Publishers
Nilsson, U.: AID: an alternative implementation of DCGs. New Generation Computing 4 (1986) 383–399
Nilsson, M., Tanaka, H.: Cyclic tree traversal. Lecture Notes in Computer Science 225 (1986) 593–599. Springer-Verlag
Pereira, F.C.N., Warren, D.H.D.: Parsing as Deduction. Proc. of the 21st Annual Metting of the Association for Computational Linguistics (1983) 137–144. Cambridge, Mass.
Prawitz, D.: Natural Deduction, Proof-Theoretical Study (1965). Almqvist & Wiksell, Stockholm, Sweden
Rosenblueth, D. A., Peralta, J. C.: LR inference: inference systems for fixed-mode logic programs, based on LR parsing. International Logic Programming Symposium (1994) 439–453. The MIT Press
Shieber, S. M.: Using restriction to extend parsing algorithms for complex-feature-based formalisms. 23th Annual Meeting of the ACL (1985) 145–152
Stolzenburg, F.: Membership-constraints and some applications. Technical Report Fachberichte Informatik 5/94 (1994). Universität Koblenz-Landau, Koblenz
Vilares, M.: Efficient Incremental Parsing for Context-Free Languages. PhD thesis. University of Nice (1992)
Vilares, M., Alonso, M. A.: An LALR extension for DCGs in dynamic programming. In C. Martín Vide (ed.): Mathematical Linguistics II (1997). John Benjamins Publishing Company
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilares, M., Alonso, M.A., Cabrero, D. (1999). An Operational Model for Parsing De.nite Clause Grammars with In.nite Terms. In: Lecomte, A., Lamarche, F., Perrier, G. (eds) Logical Aspects of Computational Linguistics. LACL 1997. Lecture Notes in Computer Science(), vol 1582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48975-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-48975-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65751-4
Online ISBN: 978-3-540-48975-7
eBook Packages: Springer Book Archive