Third iteration of QMake parser, looking for a parser generator

Adam Treat treat at
Thu Jul 5 15:49:12 UTC 2007

On Thursday 05 July 2007, Andreas Pakulat wrote:
> Well, I'll see what he'll send me. I do want to have something fast,
> however I also don't want to sit down for 2 hours trying to understand
> the lexer everytime I need to change something... Its not about Roberto
> producing code that is unreadable, its just about a state-machine in C++
> is not as easy to understand - IMHO (especially with various lookups
> into tables with just plain numbers) - as some if( regex.match(input)
> )..

I don't think you'll have any problem understanding it.  He simply looks up 
keywords character by character.  And he groups keywords by word length and 
alphabetical.  I couldn't imagine a faster or clearer approach.


More information about the KDevelop-devel mailing list