Most effective way to parse C-like definition strings?

Question

I\'ve got a set of function definitions written in a C-like language with some additional keywords that can be put before some arguments(the same way as \"unsigned\" or \"re

Answer 1

actually, it depends how complex is your language and whether it's really close to C or not...

Still, you could use lex as a first step even for regular expression ....

I would go for lex + menhir and o'caml....

but any flex/yacc combination would be fine..

The main problem with regular bison (the gnu implementation of yacc) stems from the C typing.. you have to describe your whole tree (and all the manipulation functions)... Using o'caml would be really easier ...