On parsing and condensing substrings of LR languages in linear time

Theoretical Computer Science

Volumn 267, Issue 1-2, 2001, Pages 61-82

  Goeman, Heiko ^b  

^a UNIVERSITY OF BONN   (Germany)

^b NONE

Author keywords

Context free grammars; Formal languages; LR(k) grammars; Parsing; Substrings

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES;

PARSING;

CONTEXT FREE GRAMMARS;

EID: 0035964963     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00296-6     Document Type: Conference Paper

References (5)

1. Recognizing substrings of LR(k) languages in linear time
2. An LR substring parser applied in a parallel environment
3. An LR substring parser for noncorrecting syntax error recovery
4. Noncorrecting syntax error recovery