Results 21 to 30 of about 84,961 (134)
Efficient probabilistic top-down and left-corner parsing [PDF]
Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -, 1999 8 pages, 3 tables, 3 ...
Roark, Brian, Johnson, Mark
openaire +2 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 +1 more source
Frontiers in Psychology, 2016 Speech sound perception is one of the most fascinating tasks performed by the human brain. It involves a mapping from continuous acoustic waveforms onto the discrete phonological units computed to store words in the mental lexicon.
Anna Dora Manca, Mirko Grimaldi
doaj +1 more source
Error Reporting in Parsing Expression Grammars
, 2016 Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow ...
Ierusalimschy, Roberto +3 more
core +1 more source
TOP-DOWN PARSING WITH SIMULTANEOUS EVALUATION OF NONCIRCULAR ATTRIBUTE GRAMMARS [PDF]
Fundamenta Informaticae, 1994 This paper introduces a machinery called attributed top–down parsing automaton which performs top-down parsing of strings and, simultaneously, the evaluation of arbitrary noncircular attribute grammars. The strategy of the machinery is based on a single depth–first left–to–right traversal over the syntax tree. There is no need to traverse parts of the
Noll, Thomas, Vogler, Heiko
openaire +2 more sources
Parsing macro grammars top down
Information and Control, 1979 A top-down parsing scheme for macro grammars is proposed. It extends the recursive descent method frequently used in context-free parsing. It is shown to be decidable if a macro grammar is top-down parsable. Nearly matching lower and upper bounds for the complexity of the decision procedure are derived.
openaire +3 more sources
Improved ESP-index: a practical self-index for highly repetitive texts
, 2014 While several self-indexes for highly repetitive texts exist, developing a practical self-index applicable to real world repetitive texts remains a challenge.
F. Claude +10 more
core +1 more source
Top-Down Parsing with Parsing Contexts
, 2014 The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge ...
Kurš Jan +2 more
openaire +3 more sources
A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation [PDF]
, 1997 This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which incorporates strong top–down predictions (deriva- tions and adjacencies).
Quesada Moreno, José Francisco
core
Advanced Error Recovery during Top-Down Parsing [PDF]
, 2015 Syntaktický analyzátor je jednou z nejdůležitějších částí překladače při často používaném přístupu syntaxí řízený překlad. Při tomto přístupu řídí syntaktický analyzátor sémantické akce a generování abstraktního syntaktického stromu.
Obluková, Alena
core