Bericht_Nr.465_T ... - TUHH

BNF-PROGRAMMIERBARER PARSER .f i 1 Ei: BL .
286:
287:
288:
289:
291:
293:
2'7>4:
295:
296:
'-."':)0.
1.
":"/'
299: liI
3!J1 :
3Qj2:
3iij3:
304:
3QJ5:
3iij6:
307:
3m8:
.309:
3Hj:
311:
312:
.~,1~,:
.314:
315:
316:
317:
318:
319:
321 :
322:
~~"T.
"_'4"_'.
324:
~~~
.':;.":;;::J:
326:
327:
~'-'o.
'-''':'''-'.
33iij:
331:
~~",",:,I.
'-"-''':''
.
..:;,..:;...:;.:
335:
~~
..::...::. 6 :
337:
338:
339:
34fJ;
341 :
342:
!.";
')
1
1
1
1
voi d tenT'
struct
{
auto struct Node
C
10-MAR-1986 16:22:27
while «'3' (= tolower (syrn) && tolower (svrn)
,
.i
J '. ./l term >~:/
-. .-1 c:.
- =~"
:: sym == ' (=' ::
I!
sym -- :' r:' L ! I s;.ym
__ '{:O) {
;* exoression -
vaid excression
analyse
(p~ q~
bnf expression
r~ 5) /*
syntax strueture
(Var p~ q~ r~ s
*/
: NodePtr); *!
struct
{
I'JOCE **p~ Uq~ :nr~ ;Us;
auto struct Node 'q1~ '51;
term (p~ q~ r', Si;
while (s.vm == ':') {
GetSym ();
term (~.~«*q)->alt). ~,q1~ ~,«*s)->sue)~ ~61);
*q = 1::11; l,=. = s 1 ;
.-,
.... J'.
'. J /:t: e: