H ? « ‹ ← → › »

Language peer sets for Ingerman generalised BNF:
United States↑
United States/1959↑
Designed 1959 ↑
1950s languages ↑
Second generation↑
Early Cold War↑
Specialised Languages ↑
Specialised Languages/1959↑
Specialised Languages/us ↑

Ingerman generalised BNF(ID:8012/)

alternate simple view
Country: United States
Designed 1959
Sammet category: Specialised Languages

Extensions to BNF to make a true compiler generator

Peter Ingerman, University of Pennsylvania 1959-1963

Note that stacks - called cellar-principle lists in Rutishauser etc are here called "Cafeteria-style last-in-first-out lists". Is this the first use of the terms?

Places
People:
Related languages
BNF → Ingerman generalised BNF   Extension of
References:
  • Ingerman, P. Z. (1959) Ingerman, P. Z. "A new algorithm for algebraic translation" Extract: Rationale and description of system
          in (1959) SESSION: Automatic programming: algorithm translators
  • Ingerman, Peter Zilahy (1962) Ingerman, Peter Zilahy "A translation technique for languages whose syntax is expressible in extended Backus Normal Form"
          in (1962) Symbolic Languages in Data Processing, in the Proceedings of the Symposium organized and edited by the International Computation Centre, Rome, Italy, March 26­31, 1962, Gordon and Beech Science Publishers, 1962.
  • Ingerman, Peter Zilahy: (1963) Ingerman, Peter Zilahy: "A syntax-oriented compiler for languages whose syntax is expressible in Backus Normal Form and some proposed extensions thereto" Master's Thesis. Philadelphia, Pa. Moore School of Electrical Engineering, University of Pennsylvania 1963.
          in (1962) Symbolic Languages in Data Processing, in the Proceedings of the Symposium organized and edited by the International Computation Centre, Rome, Italy, March 26­31, 1962, Gordon and Beech Science Publishers, 1962.
    Search in: Google  Google scholar  World Cat  Yahoo  Overture  DBLP  Monash bib  NZ  IEEE  ACM portal  CiteSeer  CSB  ncstrl  jstor  Bookfinder