Results 11 to 20 of about 7,325 (155)
A Drop-in Replacement for LR(1) Table-Driven Parsing [PDF]
Advances in Computing and Engineering, 2021 This paper presents a construction method for a deterministic one-symbol look-ahead LR parser which allows non-terminals in the parser look-ahead. This effectively relaxes the requirement of parsing the reverse of the right-most derivation of a string ...
Michael Oudshoorn
doaj +2 more sources
Apportioning Development Effort in a Probabilistic LR Parsing System through Evaluation [PDF]
, 1996 We describe an implemented system for robust domain-independent syntactic parsing of English, using a unification-based grammar of part-of-speech and punctuation labels coupled with a probabilistic LR parser.
Briscoe, Ted, Carroll, John
core +5 more sources
LLLR Parsing: a Combination of LL and LR Parsing [PDF]
, 2016 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 +3 more sources
The Lane Table Method Of Constructing LR(1) Parsers [PDF]
, 2009 The first practical application of the LR algorithm was by [1] for the LALR(1) subset of LR(1) grammars. In [2] an efficient method of producing an LR(1) parser for all LR(1) grammars was described which involves resolving conflicts at states of the LR(0)
Pager, D.
core +2 more sources
On Parsing Programming Languages with Turing-Complete Parser
Mathematics, 2023 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
Mathematics, 2022 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]
Electronic Proceedings in Theoretical Computer Science, 2019 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
Труды Института системного программирования РАН, 2019 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
Penerapan Algoritma Lalr Parser Dan Context-free Grammar Untuk Struktur Kalimat Bahasa Indonesia [PDF]
, 2017 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
Programmable Microwaveable Chemistry in the Chemputer
Angewandte Chemie, EarlyView.The Chemputer integrates complementary microwave modules under χDL control, enabling fully automated syntheses of O‐alkylation products, Suzuki–Miyaura cross‐couplings, ring‐closing metathesis, and peptide sequences via solid‐phase methods. This modular, programmable platform delivers flexible and scalable microwave‐assisted workflows, broadening ...
Jacopo Zero +5 more
wiley +2 more sources