A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superdeterministic DPDAs: The method of accepting does affect decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Strict Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parsing of Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalence of grammars through transformation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two decidability results for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct algorithm for checking equivalence of LL(k) grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of equivalence for deterministic stateless pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time strict deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on the equivalence problem for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of a Two-Phase Strategy for Routing in Interconnection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the KH algorithm fors-grammars / rank
 
Normal rank

Latest revision as of 18:38, 13 June 2024

scientific article
Language Label Description Also known as
English
A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
scientific article

    Statements

    A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (English)
    0 references
    0 references
    1983
    0 references
    0 references
    context-free grammar
    0 references
    Greibach normal form
    0 references
    strict deterministic grammar
    0 references
    LL(k) grammar
    0 references
    branching algorithm
    0 references
    equivalence
    0 references
    skipping
    0 references