Regular Approximation of CFLS: A Grammatical View
- 1 January 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Context-free parsing through regular approximationPublished by Association for Computational Linguistics (ACL) ,1998
- Approximating context-free grammars with a finite-state calculusPublished by Association for Computational Linguistics (ACL) ,1997
- An optimal tabular parsing algorithmPublished by Association for Computational Linguistics (ACL) ,1994
- Practical arbitrary lookahead LR parsingJournal of Computer and System Sciences, 1990
- On the Design of Finite Transducers for Parsing Phrase-Structure LanguagesPublished by John Benjamins Publishing Company ,1987
- Extending lookahead for LR parsersJournal of Computer and System Sciences, 1981
- TRANSDUCERS AND GRAMMARS AS THEORIES OF LANGUAGETheoretical Linguistics, 1981
- Economy of description by automata, grammars, and formal systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- A note on phrase structure grammarsInformation and Control, 1959
- On certain formal properties of grammarsInformation and Control, 1959