3 ms·
Regular Expression Matching: the Virtual Machine Approach
- winter_blue 17y agoFor reference: http://news.ycombinator.com/item?id=466845 http://news.ycombinator.com/item?id=466845 -> http://swtch.com/~rsc/regexp/regexp1.html http://swtch.com/~rsc/regexp/regexp1.html (HN's discussion of a prequel to this article)
- mascarenhas 17y agoThis virtual machine approach works great for Parsing Expression Grammars, because of restricted backtracking: http://www.inf.puc-rio.br/~roberto/docs/peg.pdf http://www.inf.puc-rio.br/~roberto/docs/peg.pdf