Tabular parsing and algebraic transformations
نویسندگان
چکیده
منابع مشابه
Tabular parsing and algebraic transformations
We present an algebraic description of tabular parsing algorithms that avoids a significant problem of Sikkel’s description, namely that inconsistent parse items cannot be represented. We show that a parse item must be regarded as a pair consisting of a congruence class of partial parse trees and a tuple of strings. A tabular parsing algorithm is described algebraically by a pair of algebras wi...
متن کاملTabular Parsing
Parsing is the process of determining the parses of an input string according to a grammar. In this chapter we will restrict ourselves to context-free grammars. Parsing is related to recognition, which is the process of determining whether an input string is in the language described by a grammar or automaton. Most algorithms we will discuss are recognition algorithms, but since they can be str...
متن کاملEfficient Tabular LR Parsing
We give a new treatment of tabular LR parsing, which is an alternative to Tomita’s generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar transformations and standard tabulation techniques also know as chart parsing. Secondly, the static and dynamic complexity of parsing, both in space and time...
متن کاملAn Optimal Tabular Parsing Algorithm
In this paper we relate a number of parsing algorithms which have been developed in very diierent areas of parsing theory, and which include deterministic algorithms , tabular algorithms, and a parallel algorithm. We show that these algorithms are based on the same underlying ideas. By relating existing ideas, we hope to provide an opportunity to improve some algorithms based on features of oth...
متن کاملTabular Algorithms for TAG Parsing
We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00352-8