Results 211 to 220 of about 65,747 (262)

Producing the left parse during bottom-up parsing

Information Processing Letters, 2005
Schmeiser and Barnard described a method for producing the left parse at the end of the bottom-up parsing process. We improve their method in the sense that the left parse is actually produced during the bottom-up parsing process (i.e., with considerably less delay).
Boštjan Slivnik, Bostjan Vilfan
openaire   +2 more sources

Bottom Up Parsing

1989
The declarative reading of a logic grammar specifies the strings that are in the language generated by the grammar; the procedural reading of a logic grammar specifies how strings of the language are generated or analyzed. Up until now we have used a top-down (with respect to the parse tree) procedural reading for our logic grammars: grammar rules are ...
Veronica Dahl, Harvey Abramson
openaire   +2 more sources

Finding a vine's structure by bottom-up parsing of cane edges

2013 28th International Conference on Image and Vision Computing New Zealand (IVCNZ 2013), 2013
A vine pruning robot uses stereo cameras to build a 3D model of vines. The robot's 3D reconstruction scheme requires the 2D structure of the vine to be extracted from each image. This paper describes how the 2D structure is extracted. We propose an image grammar-based model for how a vine generates an image.
Richard Green, Steven Mills, Tom Botterill   +2 more
openaire   +2 more sources

Canonical Bottom-up Parsing

1976
A general theory of canonical bottom-up analysis is presented; it includes the familiar types of deterministic bottom-up parsing methods (e.g. precedence, bounded right context, LR, and LR-regular) as special cases. Among the results obtained are sufficient conditions on the means of construction to guarantee the resulting bottom-up-parsing method ...
openaire   +2 more sources

Toward a Bottom-Up Parsing Virtual Machine

2010 Second International Conference on Computer Engineering and Applications, 2010
This paper proposes a virtual machine specialized for bottom-up parsing. All existing parser generators are tightly coupled to their target programming languages. In this paper’s approach, generated parsers are written in machine code for a virtual machine. They are loosely coupled to any programming languages.
openaire   +2 more sources

On the Inference of Context-Free Grammars Based On Bottom-Up Parsing and Search

2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009
We consider the problem of incremental learning of context-free grammars, using inductive CYK (Cocke-YoungerKasami) algorithm [4], based on the non-deterministic learning scheme proposed by Nakamura and Matsumoto in 2005 [1]. We implement their learning scheme deterministically and illustrate several examples in order to understand the incremental ...
Gend Lal Prajapati, Aditya Jain, Mayank Khandelwal, Pooja Nema, Priyanka Shukla   +4 more
openaire   +2 more sources

A bottom‐up parsing method for complete context‐free tree languages

Systems and Computers in Japan, 1986
AbstractThis paper proposes a bottom‐up parsing method for complete context‐free tree grammar. The complete context‐free tree grammar is an extension both of one‐dimensional context‐free grammar and regular tree grammar. This parsing method is an extension of the parsing method of Cocke‐Kasami‐Younger for one‐dimensional context‐free languages, and is ...
Kazumi Matsuura, Kyota Aoki
openaire   +1 more source

Language modeling using efficient best-first bottom-up parsing

2003 IEEE Workshop on Automatic Speech Recognition and Understanding (IEEE Cat. No.03EX721), 2004
In this paper we present a two-stage best-first bottom-up word-lattice parser which we use as a language model for speech recognition. The parser works by using a "figure of merit" that selects lattice paths while simultaneously selecting syntactic category edges for parsing. Additionally, we introduce a modified version of the inside-outside algorithm
Keith Hall, Mark Johnson
openaire   +2 more sources

Incremental learning of context free grammars based on bottom-up parsing and search

Pattern Recognition, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhiko Nakamura, Masashi Matsumoto
openaire   +1 more source

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