Results 11 to 20 of about 1,597 (177)
Science of Computer Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hesselink, Wim H.; id_orcid
core +12 more sources
Parameterized LR Parsing [PDF]
Electronic Notes in Theoretical Computer Science, 2004 AbstractCommon LR parser generators lack abstraction facilities for defining recurring patterns of productions. Although there are generators capable of supporting regular expressions on the right hand side of productions, no generator supports user defined patterns in grammars.Parameterized LR parsing extends standard LR parsing technology by ...
Thiemann, Peter, Neubauer, Matthias
openaire +3 more sources
Enhancing the LR Parsing Strategy Using Incremental GPLR Parsing Method [PDF]
مجلة علوم ذي قار, 2019 Parsers in modern integrated development environments (IDEs) for generalpurpose languages are virtually all of ad hoc, recursive descent variety. While such parsers have many disadvantages when compared with machine-generated LALR(1) parsers but they ...
Mouiad Abid Hani +1 more
doaj +6 more sources
On LR Parsing with Selective Delays [PDF]
, 2013 The paper investigates an extension of LR parsing that allows the delay of parsing decisions until a sufficient amount of context has been processed. We provide two characterizations for the resulting class of grammars, one based on grammar transformations, the other on the direct construction of a parser.
Eberhard Bertsch +2 more
openaire +3 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. To resolve LL conflicts it triggers small embedded LR parsers.
Slivnik, Boštjan
openaire +5 more sources
A parsing automata approach to LR theory [PDF]
Theoretical Computer Science, 1981 AbstractTwo simple but powerful tools are introduced in LR theory, viz. item grammars and parsing automata. Parsing automata are used to define a large class of correct prefix parsers operating in linear time. DeRemer's and Pager's parsing methods turn out to be special cases.
Heilbrunner, Stephan
openaire +3 more sources
Generalised LR parsing algorithms. [PDF]
, 2006 This thesis concerns the parsing of context-free grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any context-free grammar is called a generalised (context-free) parser.
Economopoulos, Giorgos Robert +1 more
openaire +4 more sources
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
Digitization and mapping of national legacy soil data of Montenegro
Soil and Water Research, 2018 This paper describes the process of digitizing Montenegro's legacy soil data, and an initial attempt to use it for digital soil mapping (DSM) purposes. The handwritten legacy numerical records of physical and chemical properties for more than 10 000 soil
Edin SALKOVIĆ +4 more
doaj +1 more source
Transformations of grammars and translation directed by $LR$ parsing [PDF]
, 1968 summary:The class of $LR$ translation grammars is introduced. This class is characterized by a possibility to implement a formal translation as an algorithm directed by $LR$ parsing. To perform a translation, the conventional $LR$ parser is extended by a
Bac, Nguyen van +3 more
core +1 more source