Shevek (shevek) wrote,

I realized today, as I hand-coded a lexer and parser, that I always write table- or switch-driven machines, even when hand-coding, and never recursive-descent (which is meant to be the 'standard' for hand-coding). I'm not sure if I've attained a state of zen codership, or if I've merely regressed to the old school. The rumour is that the best C and C++ compilers are RD - I can believe it, but I can't help feeling that a parser without stack frames leads one to better error reporting and recovery.
  • Post a new comment


    default userpic

    Your reply will be screened

    Your IP address will be recorded 

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.