> > It seems pretty clear that one can supply tokenizer-based alternatives to > the character parsers that are present in any of the combinator libraries. > That is: you can build a parser that preserves a phase distinction while > still using parser combinators. I'm not clear why I can't find any examples > of this in the wild. >
Roman Cheplyaka describes this approach here: https://ro-che.info/articles/2015-01-02-lexical-analysis
_______________________________________________ bitc-dev mailing list bitc-dev@coyotos.org http://www.coyotos.org/mailman/listinfo/bitc-dev
