Groups | Search | Server Info | Login | Register
Groups > comp.compilers > #234
| Path | csiph.com!x330-a1.tempe.blueboxinc.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!news.iecc.com!nerds-end |
|---|---|
| From | Gene <gene.ressler@gmail.com> |
| Newsgroups | comp.compilers |
| Subject | Re: grammar based programming |
| Date | Fri, 12 Aug 2011 14:40:13 -0700 (PDT) |
| Organization | Compilers Central |
| Lines | 24 |
| Sender | news@iecc.com |
| Approved | comp.compilers@iecc.com |
| Message-ID | <11-08-017@comp.compilers> (permalink) |
| References | <11-08-010@comp.compilers> |
| NNTP-Posting-Host | news.iecc.com |
| X-Trace | gal.iecc.com 1313202093 88433 64.57.183.58 (13 Aug 2011 02:21:33 GMT) |
| X-Complaints-To | abuse@iecc.com |
| NNTP-Posting-Date | Sat, 13 Aug 2011 02:21:33 +0000 (UTC) |
| Keywords | parse |
| Posted-Date | 12 Aug 2011 22:21:33 EDT |
| X-submission-address | compilers@iecc.com |
| X-moderator-address | compilers-request@iecc.com |
| X-FAQ-and-archives | http://compilers.iecc.com |
| Xref | x330-a1.tempe.blueboxinc.net comp.compilers:234 |
Show key headers only | View raw
On Aug 8, 2:50 pm, "compiler....@h-rd.org" <compiler....@h-rd.org> wrote: > recently I got interested in trying to use a grammar like approach to > programming. My ideas were a bit inspired by PEG implementations and > their usual capability of semantic actions. Basically programming in > something like BNF. Do you know some references or links or the > proper name for grammar based programming? I only found two papers: > > Constructing Programs as Executable Attribute Grammars by Frost (http://cs.uwindsor.ca/~richard/PUBLICATIONS/COMPJ_92.pdf) > > Programming with Grammars by Hehner (http://www.cs.toronto.edu/~hehner/PwG.pdf) I doubt it. Or in a very broad sense you could say functional programming has subsumed this idea. Attribute grammars, despite what the authors claim, suffer from a big declarative semantics gap -- a "too much magic" problem much like the one that also prevented logic programming, e.g. Prolog, from becoming mainstream. AGs describe a computation, but there are so many hidden evaluation details that getting from a spec to an ag "program" can be far from intuitive. See http://portal.acm.org/citation.cfm?id=808247 for the effort that took ag's about as far as usefully possible, IMO.
Back to comp.compilers | Previous | Next — Previous in thread | Find similar
grammar based programming "compiler.ddj@h-rd.org" <compiler.ddj@h-rd.org> - 2011-08-08 20:50 +0200 Re: grammar based programming Gene <gene.ressler@gmail.com> - 2011-08-12 14:40 -0700
csiph-web