Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: RFC: Parsing with perl - Regexes and beyond

by moritz (Cardinal)
on Apr 03, 2008 at 16:03 UTC ( #678194=note: print w/ replies, xml ) Need Help??


in reply to Re: RFC: Parsing with perl - Regexes and beyond
in thread RFC: Parsing with perl - Regexes and beyond

This is a little misleading.

Well, it's the worst case runtime. In the normal case it's not that bad, but the fact remains that in general lexing is more efficient than parsing.

You're right that most grammars can be parsed in linear time (actually many grammars have their current shape to facilitate parsing).


Comment on Re^2: RFC: Parsing with perl - Regexes and beyond

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://678194]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (12)
As of 2014-07-30 07:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (229 votes), past polls