Related articles |
---|
dynamic yacc-tables? canver@cyborg.informatik.uni-ulm.de (1991-08-12) |
Re: dynamic yacc-tables? pardo@gar.cs.washington.edu (1991-08-13) |
Re: dynamic yacc-tables? rekers@cwi.nl (1991-08-13) |
Re: dynamic yacc-tables? joshua@veritas.com (1991-08-13) |
Re: dynamic yacc-tables? salomon@ccu.umanitoba.ca (1991-08-13) |
Re: dynamic yacc-tables? kjell@cs.ucsc.edu (Kjell Post) (1991-08-14) |
Re: dynamic yacc-tables? markh@csd4.csd.uwm.edu (1991-08-16) |
Newsgroups: | comp.lang.c,comp.compilers |
From: | pardo@gar.cs.washington.edu (David Keppel) |
Keywords: | parse, yacc |
Organization: | Computer Science & Engineering, U. of Washington, Seattle |
References: | 91-08-043 |
Date: | Tue, 13 Aug 91 01:49:43 GMT |
canver@cyborg.informatik.uni-ulm.de (Ercument Canver) writes:
>[Modify the grammar for defining infix operators, overloading dynamically.]
Maybe:
%A Boris Burshteyn
%T On The Modification of the Formal Grammar At Parse Time
%J SIGPLAN Notices
%V 25
%N 5
%D May 1990
%P 117-123
%W pardo
%X * Parsers normally perform reductions and then call semantic action
routines.
* Many of the semantic actions are easily represented as specialized
parse rules e.g., ``ident = expr'' has a semantic action that checks
the type.
* Can also be represented as parsing ``int-ident = int-expr'',
``char-ident = char-expr'' and so on.
* However (a) large # of rules and (b) some types aren't known until
runtime.
* Add and delete grammar productions in a controlled way during
parsing e.g., ``int foo'' creates rules for ``ident-foo =
int-expr''.
;-D on ( Did you write your grammer a thank-you note? ) Pardo
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.