Results 21 to 30 of about 163,441 (217)
Tolerant parsing using modified LR(1) and LL(1) algorithms with embedded “Any” symbol
Tolerant parsing is a form of syntax analysis aimed at capturing the structure of certain points of interest presented in a source code. While these points should be well-described in a tolerant grammar of the language, other parts of the program are ...
Alexey Valerievitch Goloveshkin
doaj +1 more source
LLLR Parsing: a Combination of LL and LR Parsing [PDF]
A new parsing method called LLLR parsing is defined and a method for producing LLLR parsers is described. An LLLR parser uses an LL parser as its backbone and parses as much of its input string using LL parsing as possible.
core +1 more source
LL conflict resolution using the embedded left LR parser
A method for resolving LL(k) conflicts using small LR(k) parsers (called embedded left LR(k) parsers) is described. An embedded left LR(k) parser is capable of (a) producing the prefix of the left parse of the input string and (b) stopping not on ...
B. Slivnik
semanticscholar +1 more source
Certain techniques for modifying LR(k) parsing tables to decrease their size have been developed by Korenjak [2] and DeRemer [3, 4]. We show that the techniques of the latter can be characterized by two transformations on sets of tables. We then show that the “simple” LR(1) method of DeRemer [4] can be considered a special case of Korenjak's method [2].
Alfred V. Aho, Jeffrey D. Ullman
openaire +2 more sources
Penerapan Algoritma Lalr Parser Dan Context-free Grammar Untuk Struktur Kalimat Bahasa Indonesia [PDF]
Penyajian bahasa dalam bentuk tulisan, dapat menyimpan pengetahuan dari generasi ke generasi berikutnya. Setiap penulisan karya tulis seperti buku, hendaknya ditulis dengan tata bahasa yang benar sesuai kaidah-kaidah bahasa Indonesia, karena akan ...
Hidayat, T. (Taufiq)+2 more
core +2 more sources
A grammatical specification of human-computer dialogue [PDF]
The Seeheim Model of human-computer interaction partitions an interactive application into a user-interface, a dialogue controller and the application itself.
Nymeyer, Albert
core +2 more sources
Towards Efficient, Typed LR Parsers
AbstractThe LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to produce parsers that are well-typed (so they cannot unexpectedly crash or fail) and nevertheless efficient ...
Pottier, François, Régis-Gianas, Yann
openaire +3 more sources
LR parsers for natural languages [PDF]
MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a shift-reduce parser which is deterministically guided by a parsing table. A parsing table can be obtained automatically from a context-free phrase structure grammar.
openaire +3 more sources
Research on Architectures for Integrated Speech/Language Systems in Verbmobil [PDF]
The German joint research project Verbmobil (VM) aims at the development of a speech to speech translation system. This paper reports on research done in our group which belongs to Verbmobil's subproject on system architectures (TP15).
Görz, Günther+3 more
core +5 more sources
Faster reachability analysis for LR(1) parsers [PDF]
We present a novel algorithm for reachability in an LR(1) automaton. For each transition in the automaton, the problem is to determine under what conditions this transition can be taken, that is, which (minimal) input fragment and which lookahead symbol allow taking this transition.
Bour, Frédéric, Pottier, François
openaire +2 more sources