From: | "Armel" <armelasselin@hotmail.com> |
Newsgroups: | comp.compilers |
Date: | Wed, 19 Nov 2008 10:23:44 +0100 |
Organization: | les newsgroups par Orange |
References: | 08-11-061 |
Keywords: | lex, parse, practice |
Posted-Date: | 19 Nov 2008 19:53:38 EST |
<tuxisthebirdforme@gmail.com> a icrit dans le message de news:
>I know most people anymore use lex/yacc or some derivative of these
> tools to create scanner/parser modules for their compiler projects. I
> was wondering if anyone has developed a scanner or parser that they
> personally hand-wrote?
At my previous job, I wrote a javascript interpreter, the lexer is based on
tables (generated by a soft of mine called fdc), and the parser itself is a
state based hand coded LL recursive descent parser. It was pretty easy to
code a correct javascript parser this way and in fact certainely much easier
than with a generator.
as I like that, I rewrote a new javascript interpreter for my new job
(compatible with ECMAScript 1 3rd edition) , with keywords matched against
perfect hasing function rather than binary searches, similar parser.
Armel
Return to the
comp.compilers page.
Search the
comp.compilers archives again.