On Thu, Jun 11, 2015 at 6:50 AM, Keean Schupke <ke...@fry-it.com> wrote:
> Actually I have just realised you might have been talking about the type > of the AST nodes, rather than tagging the nodes with the types of the > source language. > Yes. The question is: for a given state of a shift-reduce (bottom-up) parser, how do we express the type of the parse stack if there is no "generic" AST type? And how do we express the evolution of type of the parse stack as shift and reduce operations proceed? > In any case it uses the parser-combinator library I wrote, and the AST > tree is typed. > Since combinators inherently produce top-down parsers, and use the program stack rather than a separate parse stack, it does not seem surprising that this would be true. shap
_______________________________________________ bitc-dev mailing list bitc-dev@coyotos.org http://www.coyotos.org/mailman/listinfo/bitc-dev
