✦ LIBER ✦

An abstract machine theory for formal language parsers

✍ Scribed by David B. Benson

Publisher: Springer-Verlag
Year: 1974
Tongue: English
Weight: 842 KB
Volume: 3
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Abstract Property of Formalized Langu

An Abstract Property of Formalized Languages which Contain Hilberts ϵ-Symbol

✍ Albert Leisenring 📂 Article 📅 1968 🏛 John Wiley and Sons 🌐 English ⚖ 635 KB

An automatic microcode generator for hig

An automatic microcode generator for high level language machines

✍ R. Sridhar; Mark L. Manwaring 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 455 KB

32-Bit microprocessor architectures and

32-Bit microprocessor architectures and extended abstract machines for high level languages

✍ M. Ancona; A. Clematis; V. Gianuzzi 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 491 KB

An Abstract Formalization of Correct Sch

An Abstract Formalization of Correct Schemas for Program Synthesis

✍ Pierre Flener; Kung-Kiu Lau; Mario Ornaghi; Julian Richardson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Algorithms for producing grammars from s

Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology

✍ Horacio Feliciangeli; Gabor T. Herman 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 926 KB

We give a number of algorithms which for a finite set of finite sequences of strings of symbols decide whether or not there exists a grammar of a certain fixed type such that each of the sequences is a derivation (or subderivation) by the grammar. Whenever such grammars exist, our algorithms will ef

An abstract interpretation framework for

An abstract interpretation framework for optimizing dynamic modular logic languages

✍ Anna Ciampolini; Evelina Lamma; Paola Mello 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 726 KB