Abstract

A technique is described that provides a convenient instrument for implementation of semantics of simple declarative languages called flat languages. Semantics of a specification is defined in the paper as a set of programs derivable for solvable goals. We introduce higher-order attribute models that include more control information than conventional attribute models and explain the algorithm for dynamic evaluation of attributes on these models. A visual tool CoCoViLa is briefly described as an instrument for implementing attribute semantics of flat languages.

Keywords

MSC

03B60, 68N19, 68T15, 68T30, break 68T35, 68U20

Cite this article

@article{cai-1899,
  author  = {Pavel Grigorenko and Enn Tyugu},
  title   = {Higher-Order Attribute Semantics of Flat Declarative Languages},
  journal = {Computing and Informatics},
  volume  = {29},
  number  = {2},
  pages   = {251--280},
  year    = {2010},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2010/2/higher-order-attribute-semantics-of-flat-declarative-languages/}
}
Download .bib