An extension of earley's algorithm for S-attributed grammars

Authors:
Nelson Correa
Affiliations:
Universidad de los Andes, Bogotá, D. E., Colombia bitnet: NCORREA at ANDESCOL
Venue:
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Year:
1991

Citing 8
Cited 1

Semantic evaluation from left to right

Communications of the ACM
An efficient context-free parsing algorithm

Communications of the ACM
Rule splitting and attribute-directed parsing

Semantics-Directed Compiler Generation, Proceedings of a Workshop
Attribute-influenced LR parsing

Semantics-Directed Compiler Generation, Proceedings of a Workshop
Principle-Based Parsing

Principle-Based Parsing
An attribute-grammar implementation of Government-binding theory

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Parsing as deduction

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics

Semantics and algorithms for data-dependent grammars

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Attribute grammars are an elegant formalization of the augmented context-free grammars characteristic of most current natural language systems. This paper presents an extension of Earley's algorithm to Knuth's attribute grammars, considering the case of S-attributed grammars. For this case, we study the conditions on the underlying base grammar under which the extended algorithm may be guaranteed to terminate. Finite partitioning of attribute domains is proposed to guarantee the termination of the algorithm, without the need for any restrictions on the context-free base.