Results 21 to 30 of about 192,464 (184)
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
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 +2 more sources
, 1977 A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars.
Nijholt, Anton
core +3 more sources
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
Symbolic Lookaheads for Bottom-up Parsing [PDF]
, 2016 We present algorithms for the construction of LALR(1) parsing tables, and of LR(1) parsing tables of reduced size. We first define specialized characteristic automata whose states are parametric w.r.t.
Quaglia, Paola
core +1 more source
Science of Computer Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Incremental Parser Generation for Tree Adjoining Grammars
, 1998 This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far.
Sarkar, Anoop
core +1 more source
Efficient Monitoring of Parametric Context Free Patterns [PDF]
, 2008 Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs.
Chen, Feng +3 more
core +1 more source
, 2004 This is a tutorial on tabular parsing, on the basis of tabulation of nondeterministic push-down automata. Discussed are Earley's algorithm, the Cocke-Kasami-Younger algorithm, tabular LR parsing, the construction of parse trees, and further issues ...
Nederhof, Mark-Jan, Satta, Giorgio
core +1 more source
TriCrackNet: Trilateral Segmentation Network for Real‐Time Crack Segmentation
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT To achieve high‐precision real‐time crack segmentation, we propose TriCrackNet, an efficient network based on a tri‐branch collaborative architecture incorporating boundary constraints, semantic parsing, and spatial refinement. In the semantic branch, efficient atrous spatial pyramid pooling (EASPP) is integrated.
Haixin Jia +5 more
wiley +1 more source