Results 11 to 20 of about 7,307 (201)
An alternative method of training probabilistic LR parsers [PDF]
We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are nonoptimal, in the sense that a collection of probability distributions cannot be obtained. In particular, some probability distributions expressible in terms of a context-free grammar cannot be expressed in ...
Mark-Jan Nederhof, Giorgio Satta
openalex +5 more sources
On Parsing Programming Languages with Turing-Complete Parser
A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language.
Boštjan Slivnik, Marjan Mernik
doaj +1 more source
The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character ...
Žiga Leber+3 more
doaj +1 more source
Speeding up Generalized PSR Parsers by Memoization Techniques [PDF]
Predictive shift-reduce (PSR) parsing for hyperedge replacement (HR) grammars is very efficient, but restricted to a subclass of unambiguous HR grammars.
Mark Minas
doaj +1 more source
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
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
René Leermakers+2 more
openaire +4 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
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
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