Free Types and Parse Trees

Article View: comp.specification.z

Article #61

Back to comp.specification.z Previous Next

#61

From: Wayne Stanton
Date: Mon, 07 Sep 1992 06:41

22 lines
1118 bytes

I am trying to workout how to apply free types to a parse tree
structure.
That is, how can I use the mechanism described by Spivey
	Paragraph ::=  Ident ::= Branch | ... | Branch
	Brach     ::=  Ident [ <<Expression>> ]
to define a syntax specification, such as 
	Expression ::= Expression "+" Expression
		   |   Expression "*" Expression
		   ...
		   |   Number

If anyone knows of any papers or other sources of information
describing how to do this, I would greatly appreciate the 
assistance.

Wayne Stanton
email: stanton@marsh.cs.curtin.edu.au
	Curtin University
	Computer Science Department
	Western Australia

Technical Details

Message-ID: <stanton.715848062@marsh>

Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!sdd.hp.com!network.ucsd.edu!munnari.oz.au!uniwa!cujo!marsh!stanton

Show Full Headers

Complete Article Headers

Newsgroups: comp.specification.z
Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!sdd.hp.com!network.ucsd.edu!munnari.oz.au!uniwa!cujo!marsh!stanton
From: stanton@marsh.cs.curtin.edu.au (Wayne Stanton)
Subject: Free Types and Parse Trees
Message-ID: <stanton.715848062@marsh>
Summary: Problems working out free types, in Z.
Keywords: Free Type
Sender: news@cujo.curtin.edu.au (News Manager)
Organization: Curtin University of Technology
Date: Mon, 7 Sep 1992 06:41:02 GMT
Lines: 22