On 2 Aug 2006, at 11:50, chinlu chinawa wrote:
Keywords, or hardwired names, are normally added
in the lexer, which may be generated by Flex. If
you want to have constructs such as 'define
...', one way to do it is to make a lookup
table, where is entered along with
syntactic and semantic data
>Keywords, or hardwired names, are normally added
>in the lexer, which may be generated by Flex. If
>you want to have constructs such as 'define
>...', one way to do it is to make a lookup
>table, where is entered along with
>syntactic and semantic data. When the lexer
>finds a name, it check
On 3 Jul 2006, at 10:43, chinlu chinawa wrote:
What I'm looking for is a parser, or as I understand
it, a way in which I can define new keywords whilst
being able to process them as well as any arguments it
may take.
Keywords, or hardwired names, are normally added in the lexer, which
may be
>A LR(1) parser or parser generator? - The latter is
>described in books like the one by Aho, et al.
>"Compilers..." ("The Dragon Book"). You may also
>want to consult the Usenet newsgroup comp.compilers,
>and its FAQ published there monthly. Bison uses
>LALR(1), and its manual gives examples of
On 29 Jun 2006, at 15:04, chinlu chinawa wrote:
I learning assembly, with gnu gas, and am willing to
implement a lr(1) parser.
A LR(1) parser or parser generator? - The latter is described in
books like the one by Aho, et al. "Compilers..." ("The Dragon Book").
You may also want to consult
Hello,
I learning assembly, with gnu gas, and am willing to
implement a lr(1) parser.
I've been looking for documents where a lr(1)
language-independent implementation is shown, and I've
actually found them in many books, but all the
examples looks really complitated to me and doesn't
allow me to
