article · 1968

Syntax directed mappings of context Free languages

Cited by 11Abstract and details only

Abstract

A definition of meaning is given for languages that possess a parsing algorithm. This definition leads to consider a class of mappings called syntax directed mappings. The behavior of contextfree languages is studied in relation to the defined class of mappings and it is shown that the translation can be implemented in two passes: first by a nondeterministic push down automaton and then by a two-way deterministic push down automaton. Nondeterministic sequential machines are also studied as a particular elementary case of syntax directed mappings.

Cite this paper

APA 7

Petrone, L. (1968). Syntax directed mappings of context Free languages. https://doi.org/10.1109/swat.1968.31

MLA 9

Petrone, L. “Syntax directed mappings of context Free languages.” vol. 65, 1968, pp. 160–75, https://doi.org/10.1109/swat.1968.31.

Chicago

Petrone, L. 1968. “Syntax directed mappings of context Free languages.” https://doi.org/10.1109/swat.1968.31.

Harvard

Petrone, L. (1968) ‘Syntax directed mappings of context Free languages’. Available at: https://doi.org/10.1109/swat.1968.31.

BibTeX

@article{petrone1968syntax,
  title = {{Syntax directed mappings of context Free languages}},
  author = {Petrone, L.},
  volume = {65},
  pages = {160--175},
  year = {1968},
  doi = {10.1109/swat.1968.31}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.