bill
/
ChocoPy
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Finished all grammar - passes 24 test cases

Browse Source
master
Sanjar Ahmadov 4 years ago
parent d247243be1
commit cf3bd4d745
1 changed files with 122 additions and 28 deletions
Show Stats Download Patch File Download Diff File

140
src/main/cup/chocopy/pa1/ChocoPy.cup
Unescape View File

@ -237,19 +237,25 @@ terminal UNRECOGNIZED;
* of type <type>. */ * of type <type>. */
non terminal Program program; non terminal Program program;
non terminal List<Declaration> program_head, class_body, class_body_defs, fun_body_decs; non terminal List<Declaration> program_head, class_body, class_body_defs, fun_body_decs;
non terminal List<Stmt> stmt_list, opt_stmt_list; non terminal List<Stmt> stmt_list, opt_stmt_list, block, else_body;
non terminal Stmt stmt, expr_stmt; non terminal Stmt stmt, simple_stmt;
non terminal Expr expr, binary_expr; non terminal Expr expr, binary_expr, pexpr, cexpr, cmp_pexpr;
non terminal VarDef var_def; non terminal VarDef var_def;
non terminal ClassDef class_def; non terminal ClassDef class_def;
non terminal FuncDef fun_def; non terminal FuncDef fun_def;
non terminal Literal literal; non terminal Literal literal;
non terminal StringLiteral bin_op, comp_op;
non terminal TypedVar typed_var; non terminal TypedVar typed_var;
non terminal TypeAnnotation type, ret_type; non terminal TypeAnnotation type, ret_type;
non terminal Identifier identifier; non terminal Identifier identifier;
non terminal List<TypedVar> typed_vars; non terminal List<TypedVar> typed_vars;
non terminal GlobalDecl global_decl; non terminal GlobalDecl global_decl;
non terminal NonLocalDecl nonlocal_decl; non terminal NonLocalDecl nonlocal_decl;
non terminal List<Expr> opt_target, expr_list;
non terminal Expr target;
non terminal MemberExpr member_expr;
non terminal IndexExpr index_expr;
@ -262,6 +268,7 @@ precedence nonassoc EQUAL, NEQ, LT, GT, LEQ, GEQ, IS;
precedence left PLUS, MINUS; precedence left PLUS, MINUS;
precedence left MUL, DIV, MOD; precedence left MUL, DIV, MOD;
precedence left DOT, COMMA, LBR, RBR; precedence left DOT, COMMA, LBR, RBR;
precedence left IF, ELSE;
/* The start symbol. */ /* The start symbol. */
start with program; start with program;
@ -285,6 +292,10 @@ program_head ::= program_head:d var_def:vd {: RESULT = combine(d, v
| {: RESULT = empty(); :} | {: RESULT = empty(); :}
; ;
opt_stmt_list ::= {: RESULT = empty(); :}
| stmt_list:s {: RESULT = s; :}
;
/* class_def */ /* class_def */
class_def ::= CLASS:c identifier:id LPAR identifier:parentId RPAR COLON NEWLINE INDENT class_body:cb DEDENT {: RESULT = new ClassDef(cxleft, getRight(cb), id, parentId, cb); :}; class_def ::= CLASS:c identifier:id LPAR identifier:parentId RPAR COLON NEWLINE INDENT class_body:cb DEDENT {: RESULT = new ClassDef(cxleft, getRight(cb), id, parentId, cb); :};
@ -319,7 +330,6 @@ typed_vars ::= typed_var:tv {: RESULT= single(tv
; ;
/* fun_body */ /* fun_body */
fun_body_decs ::= fun_body_decs:fbd global_decl:gd {: RESULT= combine(fbd, gd); :} fun_body_decs ::= fun_body_decs:fbd global_decl:gd {: RESULT= combine(fbd, gd); :}
| fun_body_decs:fbd nonlocal_decl:nd {: RESULT= combine(fbd, nd); :} | fun_body_decs:fbd nonlocal_decl:nd {: RESULT= combine(fbd, nd); :}
@ -353,6 +363,37 @@ nonlocal_decl ::= NONLOCAL:n identifier:id NEWLINE {: RESULT = new NonLoc
var_def ::= typed_var:t ASSIGN literal:l NEWLINE {: RESULT = new VarDef(txleft, lxright, t, l); :}; var_def ::= typed_var:t ASSIGN literal:l NEWLINE {: RESULT = new VarDef(txleft, lxright, t, l); :};
/* stmt */
stmt ::= simple_stmt:s NEWLINE {: RESULT = s; :}
| IF:i expr:cond COLON block:b else_body:elb {: RESULT = new IfStmt(ixleft, getRight(elb), cond, b, elb); :}
| WHILE:wh expr:cond COLON block:b {: RESULT = new WhileStmt(whxleft, getRight(b), cond, b); :}
| FOR:f identifier:id IN expr:e COLON block:b {: RESULT = new ForStmt(fxleft, getRight(b), id, e, b); :}
;
else_body ::= ELSE:el COLON block:b {: RESULT = b; :}
| ELIF:el expr:cond COLON block:b else_body:elb {: RESULT = single(new IfStmt(elxleft, getRight(elb), cond, b, elb)); :}
| {: RESULT = empty(); :}
;
/* simple_stmt */
simple_stmt ::= PASS:p {: RESULT = null; :}
| expr:e {: RESULT = new ExprStmt(exleft, exright, e); :}
| RETURN:r expr:e {: RESULT = new ReturnStmt(rxleft, exright, e); :}
| RETURN {: RESULT = null; :}
| opt_target:ot expr:e {: RESULT = new AssignStmt(getLeft(ot), exright, ot, e); :}
;
opt_target ::= opt_target:ot target:t ASSIGN {: RESULT = combine(ot, t); :}
| target:t ASSIGN {: RESULT = single(t); :}
;
/* block */
block ::= NEWLINE INDENT stmt_list:sl DEDENT {: RESULT = sl; :};
/* literal */ /* literal */
literal ::= NONE:n {: RESULT = new NoneLiteral(nxleft, nxright); :} literal ::= NONE:n {: RESULT = new NoneLiteral(nxleft, nxright); :}
| BOOL:b {: RESULT = new BooleanLiteral(bxleft, bxright, b); :} | BOOL:b {: RESULT = new BooleanLiteral(bxleft, bxright, b); :}
@ -361,38 +402,91 @@ literal ::= NONE:n {: RESULT = new NoneLi
; ;
opt_stmt_list ::= {: RESULT = empty(); :} /* expr */
| stmt_list:s {: RESULT = s; :} expr ::= pexpr:ce {: RESULT = ce; :}
| NOT:n expr:exp {: RESULT = new UnaryExpr(nxleft, expxright, n, exp); :}
| expr:e1 AND:a expr:e2 {: RESULT = new BinaryExpr(e1xleft, e2xright, e1, a, e2); :}
| expr:e1 OR:o expr:e2 {: RESULT = new BinaryExpr(e1xleft, e2xright, e1, o, e2); :}
| expr:e1 IF expr:e2 ELSE expr:e3 {: RESULT = new IfExpr(e1xleft, e3xright, e2, e1, e3); :}
; ;
stmt_list ::= stmt:s {: RESULT = single(s); :}
| stmt_list:l stmt:s {: RESULT = combine(l, s); :} /* cexpr */
| stmt_list:l error {: RESULT = l; :} /*
/* If there is a syntax error in the source, this says to discard cexpr ::= pexpr:pe {: RESULT = new Expr(pexleft, pexright); :}
* symbols from the parsing stack and perform reductions until | cmp_pexpr:cp {: RESULT = new Expr(cpxleft, cpxright); :}
* there is a stmt_list on top of the stack, and then to discard
* input symbols until it is possible to shift again, reporting
* a syntax error. */
; ;
stmt ::= expr_stmt:s NEWLINE {: RESULT = s; :}
cmp_pexpr ::= pexpr:p comp_op:co cmp_pexpr:p2 {: RESULT = new BinaryExpr(p1xleft, p2xright, p1, co, p2); :}
| pexpr:p {: RESULT = new Expr(pxleft, pxright); :}
;
*/
/* pexpr */
pexpr ::= identifier:id {: RESULT = id; :}
| literal:l {: RESULT = l; :}
| LBR:lbr expr_list:l RBR:rbr {: RESULT = new ListExpr(lbrxleft, rbrxright, l); :}
| LPAR:lpar expr:e RPAR:rpar {: RESULT = e; :}
| member_expr:m {: RESULT = m; :}
| index_expr:i {: RESULT = i; :}
| member_expr:m LPAR expr_list:l RPAR:rpar {: RESULT = new MethodCallExpr(mxleft, rparxright, m, l); :}
| identifier:id LPAR expr_list:l RPAR:rpar {: RESULT = new CallExpr(idxleft, rparxright, id, l); :}
| pexpr:p1 bin_op:bo pexpr:p2 {: RESULT = new BinaryExpr(p1xleft, p2xright, p1, bo.value, p2); :}
| MINUS:m pexpr:p {: RESULT = new UnaryExpr(mxleft, pxright, m, p); :}
| pexpr:p1 comp_op:co pexpr:p2 {: RESULT = new BinaryExpr(p1xleft, p2xright, p1, co.value, p2); :}
; ;
expr_stmt ::= expr:e {: RESULT = new ExprStmt(exleft, exright, e); :} expr_list ::= expr:e {: RESULT = single(e); :}
| expr_list:el COMMA expr:e {: RESULT = combine(el, e); :}
| {: RESULT = null; :}
; ;
expr ::= binary_expr:e {: RESULT = e; :}
| NUMBER:n {: RESULT = new IntegerLiteral(nxleft, nxright, n); :} /* bin_op */
bin_op ::= PLUS:a {: RESULT = new StringLiteral(axleft, axright, "+"); :}
| MINUS:a {: RESULT = new StringLiteral(axleft, axright, "-"); :}
| MUL:a {: RESULT = new StringLiteral(axleft, axright, "*"); :}
| DIV:a {: RESULT = new StringLiteral(axleft, axright, "/"); :}
| MOD:a {: RESULT = new StringLiteral(axleft, axright, "%"); :}
;
/* comp_op */
comp_op ::= EQUAL:a {: RESULT = new StringLiteral(axleft, axright, "=="); :}
| NEQ:a {: RESULT = new StringLiteral(axleft, axright, "!="); :}
| LEQ:a {: RESULT = new StringLiteral(axleft, axright, "<="); :}
| GEQ:a {: RESULT = new StringLiteral(axleft, axright, ">="); :}
| LT:a {: RESULT = new StringLiteral(axleft, axright, "<"); :}
| GT:a {: RESULT = new StringLiteral(axleft, axright, ">"); :}
| IS:a {: RESULT = new StringLiteral(axleft, axright, "is"); :}
;
/* member_expr */
member_expr ::= pexpr:p DOT identifier:id {: RESULT = new MemberExpr(pxleft, idxright, p, id); :}
; ;
/* index_expr */
index_expr ::= pexpr:p LBR expr:e RBR:rbr {: RESULT = new IndexExpr(pxleft, rbrxright, p, e); :}
;
/* A binary expression, illustrating how to find the left and right /* target */
* source position of a phrase. */ target ::= identifier:id {: RESULT = id; :}
binary_expr ::= expr:e1 PLUS:op expr:e2 | member_expr:m {: RESULT = m; :}
{: RESULT = new BinaryExpr(e1xleft, e2xright, | index_expr:i {: RESULT = i; :}
e1, op, e2); :}
; ;
/* Extras - rules below have not been given in language reference, we have them to ease implementation */ /* Extras - rules below have not been given in language reference, we have them to ease implementation */
identifier ::= ID:idStr {: RESULT = new Identifier(idStrxleft, idStrxright, idStr); :}; identifier ::= ID:idStr {: RESULT = new Identifier(idStrxleft, idStrxright, idStr); :};
stmt_list ::= stmt:s {: RESULT = single(s); :}
| stmt_list:l stmt:s {: RESULT = combine(l, s); :}
| stmt_list:l error {: RESULT = l; :}
/* If there is a syntax error in the source, this says to discard
* symbols from the parsing stack and perform reductions until
* there is a stmt_list on top of the stack, and then to discard
* input symbols until it is possible to shift again, reporting
* a syntax error. */
;
Write Preview
Loading…
Cancel
Save