On 12 Jun 2015 3:15 pm, "Matt Oliveri" <atma...@gmail.com> wrote:
> > Actually the grammar and parsing are the same thing, its just the
parser has
> > an additional literal representation attached to leaf terms in the
grammar.
>
> I'm sure this is not literally true, so I'm not sure what you're really
saying.
Why do you think it is not? If you have
additive-expr ::= multiplicative-expr, ('+' | '-'), {additive-expr}-.
Isn't this both the parsing rules and the grammar?
We can write the grammar + typing rules in a logic language which checks
the AST. If the type-system is compositional then the parsers and the types
combine in the same way as the grammar.
So perhaps I need to revise my statement: the parsing, grammar, and type
checking can all be combined into a single specification if the type system
is compositional. (As this is what I have been working on for a while I
failed to notice it may be a special case).
Keean.
_______________________________________________
bitc-dev mailing list
bitc-dev@coyotos.org
http://www.coyotos.org/mailman/listinfo/bitc-dev
