Related articles |
---|
[2 earlier articles] |
Re: Can syntax be enough? No need of semantics. news@cuboid.co.uk (Andy Walker) (2009-09-18) |
Re: Can syntax be enough? No need of semantics. anton@mips.complang.tuwien.ac.at (2009-09-18) |
Re: Can syntax be enough? No need of semantics. news@cuboid.co.uk (Andy Walker) (2009-09-19) |
Re: Can syntax be enough? No need of semantics. dot@dotat.at (Tony Finch) (2009-09-21) |
Re: Can syntax be enough? No need of semantics. torbenm@pc-003.diku.dk (2009-09-23) |
Re: Can syntax be enough? No need of semantics. gopi.onthemove@gmail.com (gopi) (2009-09-24) |
Re: Can syntax be enough? No need of semantics. gopi.onthemove@gmail.com (gopi) (2009-09-24) |
Re: Can syntax be enough? No need of semantics. sinu.nayak2001@gmail.com (Srinu) (2009-09-29) |
From: | gopi <gopi.onthemove@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Thu, 24 Sep 2009 21:18:46 -0700 (PDT) |
Organization: | Compilers Central |
References: | 09-09-062 09-09-074 |
Keywords: | parse |
Posted-Date: | 26 Sep 2009 08:33:08 EDT |
On Sep 23, 2:39 pm, torb...@pc-003.diku.dk (Torben Fgidius Mogensen)
wrote:
> The rules describe both syntax (though ambiguously) and types. You can
> call the rules a grammar (though not context free). Here, there is only
> one (unnamed) "nonterminal", but you can annotate the turnstile (|-)
> symbol with nonterminals to describe more complex langauges.
>
> The notation is widely used to specify both static and dynamic semantics
> of langauges.
And such grammars can be implemented using tools like STF using STML
(SANKHYA Translation Modeling Language) without the need for any
programming (other than describing the rules in STML).
Thanks,
gopi
Gopi Kumar Bulusu
Chief Executive Officer
Sankhya Technologies Private Limited
http://www.sankhya.com
India Mobile : +91 94408 78042
US (Voice-Mail) : (408) 556-9757
Skype : gopibulusu
India Office : +91 44 2822 7358
<a href="http://www.sankhya.com/info/products/teraptor/teraptor.html
"> SANKHYA
Teraptor - When Performance Matters </a>
Return to the
comp.compilers page.
Search the
comp.compilers archives again.