Technical reports

Syn: a single language for specifiying abstract syntax tress, lexical analysis, parsing and pretty-printing

Richard J. Boulton

March 1996, 25 pages

DOI: 10.48456/tr-390

Abstract

A language called Syn is described in which all aspects of context-free syntax can be specified without redundancy. The language is essentially an extended BNF grammar. Unusual features include high-level constructs for specifying lexical aspects of a language and specification of precedence by textual order. A system has been implemented for generating lexers, parsers, pretty-printers and abstract syntax tree representations from a Syn specification.

Full text

PS (0.1 MB)
DVI (0.0 MB)

BibTeX record

@TechReport{UCAM-CL-TR-390,
  author =	 {Boulton, Richard J.},
  title = 	 {{Syn: a single language for specifiying abstract syntax
         	   tress, lexical analysis, parsing and pretty-printing}},
  year = 	 1996,
  month = 	 mar,
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-390.ps.gz},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-390},
  number = 	 {UCAM-CL-TR-390}
}