Poll: The run-time performance of declarative programming is, in general, …
(Please boost!)
Poll: The run-time performance of declarative programming is, in general, …
(Please boost!)
@timbray Precedent: the regexp processor of the MOO programming language used (uses!) % instead of \. I think it got this from somewhere else before it, too, but I don’t know where.
Why are you planning to write your own regexp processor instead of using Go’s? It is good and linear time (although the constant factors aren’t great in comparison to some others). You can even construct an AST from your own regexp syntax and let it do the NFA/DFA conversion and simulation for you
A mathematician is someone who believes that ‘n’ comes before ‘m’ in the alphabet