Functional chart parsing of context-free grammars

Journal of Functional Programming

Volumn 14, Issue 6, 2004, Pages 669-680

  Ljunglöf, Peter ^a  

^a UNIVERSITY OF GOTHENBURG   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CHART PARSING; SPACE COMPLEXITY; TERMINAL FUNCTIONS; TIME COMPLEXITY;

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; QUADRATIC PROGRAMMING; SET THEORY; SYNTACTICS;

CONTEXT FREE GRAMMARS;

EID: 9744273983     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796804005106     Document Type: Article

References (9)

1. Barley, J. (1970) An efficient context-free parsing algorithm. Comm. ACM, 13(2), 94-102.
2. Kasami, T. (1965) An Efficient Recognition and Syntax. Algorithm for Context-Free Languages. Technical report AFCLR-65-758, Air Force Cambridge Research Laboratory, Bedford, MA.
3. Kay, M. (1986) Algorithm schemata and data structures in syntactic processing. In: Grosz, B., Jones, K. and Webber, B. (editors), Readings in Natural Language Processing, pp. 35-70. Morgan Kaufman.
4. Kilbury, J. (1985) Chart parsing and the Barley algorithm. In: Klenk, U. (editor), Kontextfreie Syntaxen und wervandte Systeme. Niemeyer.
5. Ljunglöf, P. (2002) Pure Functional Parsing. Licenciate thesis, Göteborg University and Chalmers University of Technology, Gothenburg, Sweden.
6. Shieber, S., Schabes, Y. and Pereira, F. (1995) Principles and implementation of deductive parsing. J. Logic Program. 24(1-2), 3-36.
7. Sikkel, K. (1997) Parsing Schemata. Springer-Verlag.
8. Wirén, M. (1992) Studies in Incremental Natural-Language Analysis. PhD thesis, Linköping University, Linköping, Sweden.
9. 3 Infor. & Control, 10(2), 189-208.