Explore >> Select a destination
|
You are here 
|
serokell.io | ||
| | | | |
www.abubalay.com
|
|
| | | | | ||
| | | | |
deniskyashif.com
|
|
| | | | | In this article, we'll define a basic regular expression language using a context-free grammar and learn how to parse its strings in linear time using the recursive descent method. | |
| | | | |
www.abubalay.com
|
|
| | | | | ||
| | | | |
bloeys.com
|
|
| | | In 'Thought 2: Regex is Like Assembly' I wondered why we are still doing regex in this kind of hard to understand, symbolic way, when we have already invented high level programming languages. There is no reason regex can't be written as clearly as any other programming language we use today. I thought doing this would be an interesting project, and so I came up with Regexl, a high level language for writing regex, that can be used as a simple library. | ||
