Supposing we have two grammars which define the same languge: regular one and LALR(1) one.Both regular and LALR(1) algorithms are O(n) where n is input length.Regexps are usually preferred for parsing regular languages. Why? Is there a formal proof (or maybe that's obvious) that they are faster?
Regular vs LALR(1): what is faster
regular languages;efficiency;parsers