Results 11 to 20 of about 141,588 (171)
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 +4 more sources
Efficient tabular LR parsing [PDF]
Proceedings of the 34th annual meeting on Association for Computational Linguistics -, 1996 8 pages, uses aclap ...
NEDERHOF M. J., SATTA, GIORGIO
openaire +8 more sources
Attribute-Influenced LR Parsing [PDF]
DAIMI Report Series, 1980 <p>Methods are described which make it possible, when given an arbitrary attribute grammar (or AG),</p><ol> <li> to analyze the AG to determine which of its attributes may be computed during LR parsing; </li><li> to augment the parser with instructions and data structures to compute many attributes during parsing ...
Neil D. Jones, C. Michael Madsen
openaire +4 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
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95, 1995 Partial evaluation can turn a general parser into a parser generator. The generated parsers surpass those produced by traditional parser generators in speed and compactness. We use an inherently functional approach to implement general LR(k) parsers and specialize them using the partial evaluator Similix.
Michael Sperber, Peter Thiemann 0001
openaire +2 more sources
, 2011 We explain and illustrate abstract parsing, a static-analysis technique based on abstract interpretation, LR-parsing, and partial evaluation for validating PHP-like scripts that generate HTML/XML-style documents.
Kyung-Goo Doh +2 more
openaire +2 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
core +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 +4 more sources
Parallel incremental LR parsing
Computer Languages, 1994 A new parallel parsing algorithm for block structured languages, capable of parsing incremen- tally also, is presented. The parser is for LR grammars. A shared memory multiprocessor model is assumed. We associate processors to parse corrections independently with minimum reparsing.
Viswanathan, N, Srikant, YN
openaire +3 more sources