Normal forms of deterministic grammars (Q1238425)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Normal forms of deterministic grammars	scientific article

Statements

scholarly article

0 references

Normal forms of deterministic grammars (English)

0 references

Matthew M. Geller

0 references

Michael A. Harrison

0 references

0 references

Discrete Mathematics

0 references

publication date

1977

0 references

MaRDI profile type

MaRDI publication profile

0 references

Equivalence problems for deterministic context-free languages and monadic recursion schemes

0 references

On LR(k) grammars and languages

0 references

0 references

Deterministic context free languages

0 references

0 references

On Bounded Right Context Languages and Grammars

0 references

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

0 references

Internal and external stability of linear systems

0 references

Strict deterministic grammars

0 references

On the Parsing of Deterministic Languages

0 references

Real-Time Strict Deterministic Languages

0 references

0 references

On the translation of languages from left to right

0 references

Syntax-Directed Transduction

0 references

A Formalization of Transition Diagram Systems

0 references

Transforming LR( <i>k</i> ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars

0 references

Properties of deterministic top-down grammars

0 references

full work available at URL

https://doi.org/10.1016/s0012-365x(76)80004-0

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0012-365X(76)80004-0

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1238425

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1238425&oldid=37220794"