A generalized computational model based on graph rewriting is presente
d a long with Dactl, an associated compiler target( intermediate) lang
uage. An illustration of the capability of graph rewriting to model a
variety of computational formalisms is presented by showing how some e
xamples written originally in a number of languages can be described a
s graph rewriting transformations using Dactl notation. This is follow
ed by a formal presentation of the Dactl model before giving a formal
definition of the syntax and semantics of the language. Some implement
ation issues are also discussed.