123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293 |
- /*
- * (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 */
- /* $Id$ */
- {
- #include "debug.h"
- #include <alloc.h>
- #include <em_arith.h>
- #include <em_label.h>
- #include <assert.h>
- #include "LLlex.h"
- #include "idf.h"
- #include "def.h"
- #include "node.h"
- #include "type.h"
- #include "chk_expr.h"
- #include "warning.h"
- extern char options[];
- }
- /* inline, we need room for pdp/11
- number(t_node **p;) :
- [
- %default
- INTEGER
- |
- REAL
- ] { *p = dot2leaf(Value);
- (*p)->nd_type = toktype;
- }
- ;
- */
- qualident(t_node **p;)
- {
- } :
- IDENT { *p = dot2leaf(Name); }
- [
- selector(p)
- ]*
- ;
- selector(register t_node **pnd;)
- { t_node *nd;
- } :
- '.' { nd = dot2leaf(Select); nd->nd_NEXT = *pnd; *pnd = nd; }
- IDENT { (*pnd)->nd_IDF = dot.TOK_IDF; }
- ;
- ExpList(t_node **pnd;)
- {
- register t_node *nd;
- } :
- expression(pnd) { *pnd = nd = dot2node(Link,*pnd,NULLNODE);
- nd->nd_symb = ',';
- }
- [
- ',' { nd->nd_RIGHT = dot2leaf(Link);
- nd = nd->nd_RIGHT;
- }
- expression(&(nd->nd_LEFT))
- ]*
- ;
- ConstExpression(register t_node **pnd;)
- {
- }:
- expression(pnd)
- /*
- * Changed rule in new Modula-2.
- * Check that the expression is a constant expression and evaluate!
- */
- {
- DO_DEBUG(options['C'], print("CONSTANT EXPRESSION\n"));
- DO_DEBUG(options['C'], PrNode(*pnd, 0));
- if (ChkExpression(pnd) &&
- (*pnd)->nd_class != Set &&
- (*pnd)->nd_class != Value &&
- ! (options['l'] && (*pnd)->nd_class == Def && IsProc((*pnd)))) {
- error("constant expression expected");
- }
- DO_DEBUG(options['C'], print("RESULTS IN\n"));
- DO_DEBUG(options['C'], PrNode(*pnd, 0));
- }
- ;
- expression(register t_node **pnd;)
- {
- } :
- SimpleExpression(pnd)
- [
- /* relation */
- [ '=' | '#' | '<' | LESSEQUAL | '>' | GREATEREQUAL | IN ]
- { *pnd = dot2node(Oper, *pnd, NULLNODE); }
- SimpleExpression(&((*pnd)->nd_RIGHT))
- |
- ]
- ;
- /* Inline in expression
- relation:
- '=' | '#' | '<' | LESSEQUAL | '>' | GREATEREQUAL | IN
- ;
- */
- SimpleExpression(register t_node **pnd;)
- {
- register t_node *nd = 0;
- } :
- [
- [ '+' | '-' ]
- { nd = dot2leaf(Uoper);
- /* priority of unary operator ??? */
- }
- |
- ]
- term(pnd)
- { if (nd) {
- nd->nd_RIGHT = *pnd;
- *pnd = nd;
- }
- nd = *pnd;
- }
- [
- /* AddOperator */
- [ '+' | '-' | OR ]
- { nd = dot2node(Oper, nd, NULLNODE); }
- term(&(nd->nd_RIGHT))
- ]*
- { *pnd = nd; }
- ;
- /* Inline in "SimpleExpression"
- AddOperator:
- '+' | '-' | OR
- ;
- */
- term(t_node **pnd;)
- {
- register t_node *nd;
- }:
- factor(pnd) { nd = *pnd; }
- [
- /* MulOperator */
- [ '*' | '/' | DIV | MOD | AND ]
- { nd = dot2node(Oper, nd, NULLNODE); }
- factor(&(nd->nd_RIGHT))
- ]*
- { *pnd = nd; }
- ;
- /* inline in "term"
- MulOperator:
- '*' | '/' | DIV | MOD | AND
- ;
- */
- factor(register t_node **p;)
- {
- register t_node *nd;
- t_node *nd1;
- } :
- qualident(p)
- [
- designator_tail(p)
- [
- { *p = dot2node(Call, *p, NULLNODE); }
- ActualParameters(&((*p)->nd_RIGHT))
- |
- ]
- |
- bare_set(&nd1)
- { nd = nd1; nd->nd_LEFT = *p; *p = nd; }
- ]
- |
- bare_set(p)
- | %default
- [
- %default
- INTEGER
- |
- REAL
- |
- STRING
- ] { *p = dot2leaf(Value);
- (*p)->nd_type = toktype;
- }
- |
- '(' { nd = dot2leaf(Uoper); }
- expression(p)
- { /* In some cases we must leave the '(' as an unary
- operator, because otherwise we cannot see that the
- factor was not a designator
- */
- register int class = (*p)->nd_class;
- if (class == Arrsel ||
- class == Arrow ||
- class == Name ||
- class == Select) {
- nd->nd_RIGHT = *p;
- *p = nd;
- }
- else FreeNode(nd);
- }
- ')'
- |
- NOT { *p = dot2leaf(Uoper); }
- factor(&((*p)->nd_RIGHT))
- ;
- bare_set(t_node **pnd;)
- {
- register t_node *nd;
- } :
- '{' { DOT = SET;
- *pnd = nd = dot2leaf(Xset);
- nd->nd_type = bitset_type;
- }
- [
- element(nd)
- [ { nd = nd->nd_RIGHT; }
- ',' element(nd)
- ]*
- |
- ]
- '}'
- ;
- ActualParameters(t_node **pnd;):
- '(' ExpList(pnd)? ')'
- ;
- element(register t_node *nd;) :
- expression(&(nd->nd_RIGHT))
- [
- UPTO
- { nd->nd_RIGHT = dot2node(Link, nd->nd_RIGHT, NULLNODE);}
- expression(&(nd->nd_RIGHT->nd_RIGHT))
- |
- ]
- { nd->nd_RIGHT = dot2node(Link, nd->nd_RIGHT, NULLNODE);
- nd->nd_RIGHT->nd_symb = ',';
- }
- ;
- designator(t_node **pnd;)
- :
- qualident(pnd)
- designator_tail(pnd)
- ;
- designator_tail(register t_node **pnd;):
- visible_designator_tail(pnd)
- [ %persistent
- %default
- selector(pnd)
- |
- visible_designator_tail(pnd)
- ]*
- |
- ;
- visible_designator_tail(t_node **pnd;)
- {
- register t_node *nd = *pnd;
- }:
- '[' { nd = dot2node(Arrsel, nd, NULLNODE); }
- expression(&(nd->nd_RIGHT))
- [
- ','
- { nd = dot2node(Arrsel, nd, NULLNODE);
- }
- expression(&(nd->nd_RIGHT))
- ]*
- ']'
- { *pnd = nd; }
- |
- '^' { *pnd = dot2node(Arrow, NULLNODE, nd); }
- ;
|