Short Notes: Semantically Driven Parsing of Context-free Languages
نویسندگان
چکیده
منابع مشابه
Parsing of Context Free Languages
Parsing is the process of assigning structure to sentences The structure is obtained from the grammatical description of the language Both in Com puter Science and in Computational Linguistics context free grammars and associated parsing algorithms are among the most useful tools Numerous parsing algorithms have been developed Special subclasses of the context free grammars have been introduced...
متن کاملCertified CYK parsing of context-free languages
We report a work on certified parsing for context-free grammars. In our development we implement the Cocke–Younger–Kasami parsing algorithm and prove it correct using the Agda dependently typed programming language.
متن کاملEfficient Incremental Parsing for Context-Free Languages
An incremental parsing algorithm based on dynamic programming techniques is described’. The analyzer takes the automaton generated from a general class of context-free grammars as driver, and any finite string as input. Given an input string that has been modified, the algorithm cuts out the parts of the old analysis that had been generated b y the parts of the input that has changed. What rema...
متن کاملEecient Incremental Parsing for Context-free Languages
An incremental parsing algorithm based on dynamic programming techniques is described 1. The analyzer takes the automaton generated from a general class of context-free grammars as driver, and any nite string as input. Given an input string that has been modiied, the algorithm cuts out the parts of the old analysis that had been generated by the parts of the input that has changed. What remains...
متن کاملEfficient parallel and incremental parsing of practical context-free languages
We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algorithm is an instance of Valiant’s (1975), who reduced the problem of parsing to matrix multiplications. We show that, while the conquer step of Valiant’s is O(n), it improves to O(log n) under certain conditions satisfied by many useful inputs, and if one uses a sparse representation of matrices. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1989
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/32.1.91