On the transformation of LL\((k)\)-linear to LL(1)-linear grammars (Q6038708): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3046706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some subclasses of context-free languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear languages recognized by deterministic biautomata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down syntax nalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on top-down languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax-Directed Transduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressive power of \(\text{LL}(k)\) Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Underlying principles and recurring ideas of formal grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank

Latest revision as of 00:57, 1 August 2024

scientific article; zbMATH DE number 7681306
Language Label Description Also known as
English
On the transformation of LL\((k)\)-linear to LL(1)-linear grammars
scientific article; zbMATH DE number 7681306

    Statements

    On the transformation of LL\((k)\)-linear to LL(1)-linear grammars (English)
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    linear grammars
    0 references
    LL grammars
    0 references
    parsing
    0 references
    descriptional complexity
    0 references

    Identifiers