Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: Why OCaml sucks
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Kuba Ober <ober.14@o...>
Subject: Re: [Caml-list] Re: Why OCaml sucks
> The problem, as I understand it, is in writting parsers.  Your standard
> finite automata based regular expression library or lexical analyzer is
> based, at it's heart, on a table lookup- you have a 2D array, whose size
> is the number of input characters times the number of states.

This is just silly.

This table can be usually trivially degenerated into hardcoded 
compare-and-jumps, for most lexers I've dealt with this will astronomically 
reduce the size and increase speed.

The fact that the lexer generator you're using is dumb doesn't help, but 
please don't assume that this dumbassedness is somehow a universal constant 
and given upon us by $DEITY.

Cheers, Kuba