4 ms·
> Imagine programming without regular expressions. I live in this future and it's beautiful. Steps to programming without regular expressions: 1) find a PEG
by samatman 7y ago
> Imagine programming without regular expressions.
I live in this future and it's beautiful.
Steps to programming without regular expressions:
1) find a PEG library for your language of choice
There is no step 2.
- iagovar 7y agoSorry for asking such dub question, but what's a PEG library?
- tejtm 7y agoParsing expression grammar; It is a recursive decent parser with the tiny tweak that productions are ordered (not a set) and short circuit. A 90's language you did not have to imagine that saved you from regex in this way was[is] REBOL with it built in `parse` dsl. examples here http://www.rebol.org/search.r?find=parse&form=yes http://www.rebol.org/search.r?find=parse&form=yes [0]https://en.wikipedia.org/wiki/Parsing_expression_grammar https://en.wikipedia.org/wiki/Parsing_expression_grammar [1]http://www.rebol.com/ http://www.rebol.com/
- chrisjc 7y agoNo idea... had to look it up. Parsing Expression Grammar. https://en.wikipedia.org/wiki/Parsing_expression_grammar https://en.wikipedia.org/wiki/Parsing_expression_grammar
- linsomniac 7y agoTL;DR: PEG looks to me like simplified lex+yacc For those not familiar with PEG, like me, here: https://en.wikipedia.org/wiki/Parsing_expression_grammar https://en.wikipedia.org/wiki/Parsing_expression_grammar I found that fairly abstract, a Python example provided more concrete examples: https://github.com/erikrose/parsimonious https://github.com/erikrose/parsimonious
- nickpsecurity 7y agoQuite a few alternatives to RE's I put in this answer: https://softwareengineering.stackexchange.com/questions/194975/readable-regular-expressions-without-losing-their-power/195013#195013 https://softwareengineering.stackexchange.com/questions/1949...