3 ms·
I think in the specific case of Haskell, parser combinator libraries like Parsec are so nice that it can be more convenient to use parser combinators than regex
by ajtulloch 12y ago
I think in the specific case of Haskell, parser combinator libraries like Parsec are so nice that it can be more convenient to use parser combinators than regexes for parsing regular languages. I'm haven't seen similar substitutions in other languages.
- draegtun 12y agoRebol is another example worth looking at. It doesn't come with regex at all instead it uses a parse dialect (an embedded Top-down parsing language). Some refs: - http://www.rebol.com/docs/core23/rebolcore-15.html http://www.rebol.com/docs/core23/rebolcore-15.html - http://www.rebol.com/r3/docs/functions/parse.html http://www.rebol.com/r3/docs/functions/parse.html - http://www.codeconscious.com/rebol/parse-tutorial-r3.html http://www.codeconscious.com/rebol/parse-tutorial-r3.html - https://en.wikibooks.org/wiki/REBOL_Programming/Language_Features/Parse https://en.wikibooks.org/wiki/REBOL_Programming/Language_Fea... - https://en.wikipedia.org/wiki/Top-down_parsing_language https://en.wikipedia.org/wiki/Top-down_parsing_language