/* * (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands. * See the copyright notice in the ACK home directory, in the file "Copyright". * * Author: Ceriel J.H. Jacobs */ /* E X P R E S S I O N S */ /* $Header$ */ { #include "debug.h" #include #include #include #include #include "LLlex.h" #include "idf.h" #include "def.h" #include "node.h" #include "const.h" #include "type.h" #include "chk_expr.h" #include "warning.h" extern char options[]; } number(struct node **p;) : [ %default INTEGER | REAL ] { *p = MkLeaf(Value, &dot); (*p)->nd_type = toktype; } ; qualident(struct node **p;) { } : IDENT { *p = MkLeaf(Name, &dot); } [ selector(p) ]* ; selector(struct node **pnd;): '.' { *pnd = MkNode(Link,*pnd,NULLNODE,&dot); } IDENT { (*pnd)->nd_IDF = dot.TOK_IDF; } ; ExpList(struct node **pnd;) { register struct node *nd; } : expression(pnd) { *pnd = nd = MkNode(Link,*pnd,NULLNODE,&dot); nd->nd_symb = ','; } [ ',' { nd->nd_right = MkLeaf(Link, &dot); nd = nd->nd_right; } expression(&(nd->nd_left)) ]* ; ConstExpression(struct node **pnd;) { register struct node *nd; }: expression(pnd) /* * Changed rule in new Modula-2. * Check that the expression is a constant expression and evaluate! */ { nd = *pnd; DO_DEBUG(options['C'], print("CONSTANT EXPRESSION\n")); DO_DEBUG(options['C'], PrNode(nd, 0)); if (ChkExpression(nd) && ((nd)->nd_class != Set && (nd)->nd_class != Value)) { error("constant expression expected"); } DO_DEBUG(options['C'], print("RESULTS IN\n")); DO_DEBUG(options['C'], PrNode(nd, 0)); } ; expression(struct node **pnd;) { } : SimpleExpression(pnd) [ /* relation */ [ '=' | '#' | '<' | LESSEQUAL | '>' | GREATEREQUAL | IN ] { *pnd = MkNode(Oper, *pnd, NULLNODE, &dot); } SimpleExpression(&((*pnd)->nd_right)) ]? ; /* Inline in expression relation: '=' | '#' | '<' | LESSEQUAL | '>' | GREATEREQUAL | IN ; */ SimpleExpression(struct node **pnd;) { } : [ [ '+' | '-' ] { *pnd = MkLeaf(Uoper, &dot); pnd = &((*pnd)->nd_right); /* priority of unary operator ??? */ } ]? term(pnd) [ /* AddOperator */ [ '+' | '-' | OR ] { *pnd = MkNode(Oper, *pnd, NULLNODE, &dot); } term(&((*pnd)->nd_right)) ]* ; /* Inline in "SimpleExpression" AddOperator: '+' | '-' | OR ; */ term(struct node **pnd;) { }: factor(pnd) [ /* MulOperator */ [ '*' | '/' | DIV | MOD | AND | '&' ] { *pnd = MkNode(Oper, *pnd, NULLNODE, &dot); } factor(&((*pnd)->nd_right)) ]* ; /* inline in "term" MulOperator: '*' | '/' | DIV | MOD | AND | '&' ; */ factor(register struct node **p;) { struct node *nd; } : qualident(p) [ designator_tail(p)? [ { *p = MkNode(Call, *p, NULLNODE, &dot); } ActualParameters(&((*p)->nd_right)) ]? | bare_set(&nd) { nd->nd_left = *p; *p = nd; } ] | bare_set(p) | %default number(p) | STRING { *p = MkLeaf(Value, &dot); (*p)->nd_type = toktype; } | '(' expression(p) ')' | NOT { *p = MkLeaf(Uoper, &dot); } factor(&((*p)->nd_right)) ; bare_set(struct node **pnd;) { register struct node *nd; } : '{' { dot.tk_symb = SET; *pnd = nd = MkLeaf(Xset, &dot); nd->nd_type = bitset_type; } [ element(nd) [ { nd = nd->nd_right; } ',' element(nd) ]* ]? '}' ; ActualParameters(struct node **pnd;): '(' ExpList(pnd)? ')' ; element(struct node *nd;) { struct node *nd1; } : expression(&nd1) [ UPTO { nd1 = MkNode(Link, nd1, NULLNODE, &dot);} expression(&(nd1->nd_right)) ]? { nd->nd_right = MkNode(Link, nd1, NULLNODE, &dot); nd->nd_right->nd_symb = ','; } ; designator(struct node **pnd;) : qualident(pnd) designator_tail(pnd)? ; designator_tail(struct node **pnd;): visible_designator_tail(pnd) [ %persistent %default selector(pnd) | visible_designator_tail(pnd) ]* ; visible_designator_tail(register struct node **pnd;): '[' { *pnd = MkNode(Arrsel, *pnd, NULLNODE, &dot); } expression(&((*pnd)->nd_right)) [ ',' { *pnd = MkNode(Arrsel, *pnd, NULLNODE, &dot); (*pnd)->nd_symb = '['; } expression(&((*pnd)->nd_right)) ]* ']' | '^' { *pnd = MkNode(Arrow, NULLNODE, *pnd, &dot); } ;