Results 201 to 210 of about 182,970 (219)

Processing Left Extraposition in a Bottom-Up Parsing System

, 1991
Satoshi Kinoshita, Hozumi Tanaka
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Parallel Bottom-up Tomita parsing

1997
In the previous chapter we have derived the parsing schema LR(0) and concluded that the differences with Earley are trivial details. Hence there is a structural correspondence between Earley chart parser and generalized LR parsers. This correspondence can be used to cross-fertilize different variants of either kind algorithm. A particularly interesting
openaire   +2 more sources

A parsing method for context‐free languages using bottom‐up lookahead computation

Systems and Computers in Japan, 1996
AbstractA new parsing algorithm of context‐free languages using bottom‐up computation of lookahead information is presented. Earley's algorithm uses a great number of items during enumeration to recognize a context‐free language. If items with lookahead fields are used, the number of items can be reduced, but item spacing is considerably increased. The
Takehiro Tokuda, Yoshimichi Watanabe
openaire   +2 more sources

RETE and chart parsing from bottom-up call-graph caching

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91, 2002
A new mechanism is presented for graph instantiation. It is used to investigate various bottom-up data-driven AI algorithms. The author views instances as fairly autonomous objects that inherit graph information (e.g. links or relations) from their classes. Instances themselves can be instantiated.
openaire   +2 more sources

A bottom-up adaptation of earley's parsing algorithm

1989
in this paper we have described a new, bottom-up, parsing algorithm, derived from the standard Earley's algorithm. It is easier to understand and more efficient, thanks to the precomputation of some closure relations and to the minimization of the number of items that it computes, and yields an improved practical efficiency and a better error ...
openaire   +2 more sources

Kombinierte Topdown/Bottomup-Syntaxanalyse von LR(k)-Grammatiken/ Combined top-down/bottom-up parsing of LR(k) grammars

, 1978
D. THIMM
openalex   +1 more source

Bottom-up-Chart-Parser

, 1994
Sven Naumann, Hagen Langer
openalex   +1 more source

A modification of the LR(k) method for constructing compact bottom-up parsers

, 1979
Esko Ukkonen
openalex   +1 more source

Generalized bottom-up parsing.

, 1973
Thomas G. Szymanski
openalex  

Deterministic Bottom-Up Parsing

2007
openaire   +1 more source