Re: perl-ish regexps?

new topic     » goto parent     » topic index » view thread      » older message » newer message

Tom Elkof,
Regular Expressions are a good thing to have, however they are difficult
        to evaluate.
Unfortunately Dave's library had faults and did not evaluated all
        expresions properly.
        One of my computer science lecturers suggested using a tree.
        I suggest finding a standard algorithm and writing it in euphoria.
I have not gotten round to finding one, there is probabely one in the
        uni library.

        I wanted one to add lex features to a euphoria language builder.
-------------------------
Sincerely,
Mathew Hounsell

mat.hounsell at excite.com

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu