Normal form algorithms for extended context-free grammars (Q5958723): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An easy proof of Greibach normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dagwood / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating null rules in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4174255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence, containment, and covering problems for the regular and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greibach normal form transformation revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textit{Grail}: A C++ library for automata and expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692941 / rank
 
Normal rank

Revision as of 23:28, 3 June 2024

scientific article; zbMATH DE number 1715768
Language Label Description Also known as
English
Normal form algorithms for extended context-free grammars
scientific article; zbMATH DE number 1715768

    Statements

    Normal form algorithms for extended context-free grammars (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2002
    0 references
    0 references
    complexity
    0 references
    efficient algorithms
    0 references
    extended context-free grammars
    0 references
    grammatical representations
    0 references
    normal forms
    0 references
    symbolic manipulation
    0 references