A direct algorithm for checking equivalence of LL(k) grammars (Q1238431): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / 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: Decidable Properties of Monadic Functional Schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional schemas with nested predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple program schemes and formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / 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: Completeness results for the equivalence of recursive schemas / rank
 
Normal rank

Latest revision as of 20:37, 12 June 2024

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

    Statements

    Identifiers