A left part theorem for grammatical trees (Q1251905): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple <i>LR(k)</i> grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms of deterministic grammars / 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: Real-Time Strict Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124342 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:44, 13 June 2024

scientific article
Language Label Description Also known as
English
A left part theorem for grammatical trees
scientific article

    Statements

    A left part theorem for grammatical trees (English)
    0 references
    0 references
    1979
    0 references
    0 references
    Grammatical Trees
    0 references
    Left Part Grammars
    0 references
    Context-Free Grammars
    0 references