A parsing automata approach to LR theory (Q1157181): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(81)90067-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970158213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient LR(1) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative approach to the improvement of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: LR-regular grammars - an extension of LR(k) 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: On LR(k) grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic parsing: A framework for producing compact deterministic parsers. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truly prefix-correct chain-free LR(1) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiler construction. An advanced course / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds and Reductions Between Grammar Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of LR(k) testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the translation of languages from left to right / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of regular canonical systems to grammars translatable from left to right / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical general method for constructing LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating unit productions from LR parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4041108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning bounded-right-context grammars / rank
 
Normal rank

Latest revision as of 12:54, 13 June 2024

scientific article
Language Label Description Also known as
English
A parsing automata approach to LR theory
scientific article

    Statements

    A parsing automata approach to LR theory (English)
    0 references
    1981
    0 references
    item grammars
    0 references
    correct prefix parsers operating in linear time
    0 references
    LR grammars
    0 references

    Identifiers