An improved LALR\((k)\) parser generation for regular right part grammars (Q689632): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4068115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LALR(1,1) parser generation for regular right part grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple <i>LR(k)</i> grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of LALR(1) Look-Ahead Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of ELR(k) and ELL(k) grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular right part grammars and their parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing LR parsers for regular right part grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: LR-parsing of extended context free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of efficient LALR parsers for regular right part grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new analysis of LALR formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing extended LR(k) grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040864 / rank
 
Normal rank

Latest revision as of 11:42, 22 May 2024

scientific article
Language Label Description Also known as
English
An improved LALR\((k)\) parser generation for regular right part grammars
scientific article

    Statements

    An improved LALR\((k)\) parser generation for regular right part grammars (English)
    0 references
    0 references
    0 references
    15 November 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    formal languages
    0 references
    regular right part grammars
    0 references
    finite automata
    0 references
    extended LR(0) automaton
    0 references
    extended \(\text{LALR}(k)\) parser
    0 references
    0 references