/*--------------------------------------------------------------------------- // BoogiePL - //--------------------------------------------------------------------------*/ /*using System;*/ using PureCollections; using System.Collections; using System.Collections.Generic; using System.IO; using System.Text; using Microsoft.Boogie; using Microsoft.Basetypes; using Bpl = Microsoft.Boogie; using AI = Microsoft.AbstractInterpretationFramework; COMPILER BoogiePL /*--------------------------------------------------------------------------*/ static Program! Pgm = new Program(); static Expr! dummyExpr = new LiteralExpr(Token.NoToken, false); static Cmd! dummyCmd = new AssumeCmd(Token.NoToken, dummyExpr); static Block! dummyBlock = new Block(Token.NoToken, "dummyBlock", new CmdSeq(), new ReturnCmd(Token.NoToken)); static Bpl.Type! dummyType = new BasicType(Token.NoToken, SimpleType.Bool); static Bpl.ExprSeq! dummyExprSeq = new ExprSeq (); static TransferCmd! dummyTransferCmd = new ReturnCmd(Token.NoToken); static StructuredCmd! dummyStructuredCmd = new BreakCmd(Token.NoToken, null); /// ///Returns the number of parsing errors encountered. If 0, "program" returns as ///the parsed program. /// public static int Parse (string! filename, /*maybe null*/ List defines, out /*maybe null*/ Program program) /* throws System.IO.IOException */ { FileStream stream = new FileStream(filename, FileMode.Open, FileAccess.Read, FileShare.Read); if (defines == null) { defines = new List(); } string s = ParserHelper.Fill(stream, defines); byte[]! buffer = (!) UTF8Encoding.Default.GetBytes(s); MemoryStream ms = new MemoryStream(buffer,false); Errors errors = new Errors(); Scanner scanner = new Scanner(ms, errors, filename); Parser parser = new Parser(scanner, errors); Pgm = new Program(); // reset the global variable parser.Parse(); if (parser.errors.count == 0) { program = Pgm; return 0; } else { program = null; return parser.errors.count; } } // Class to represent the bounds of a bitvector expression t[a:b]. // Objects of this class only exist during parsing and are directly // turned into BvExtract before they get anywhere else private class BvBounds : Expr { public BigNum Lower; public BigNum Upper; public BvBounds(IToken! tok, BigNum lower, BigNum upper) { base(tok); this.Lower = lower; this.Upper = upper; } public override Type! ShallowType { get { return Bpl.Type.Int; } } public override void Resolve(ResolutionContext! rc) { rc.Error(this, "bitvector bounds in illegal position"); } public override void Emit(TokenTextWriter! stream, int contextBindingStrength, bool fragileContext) { assert false; } public override void ComputeFreeVariables(Set! freeVars) { assert false; } public override AI.IExpr! IExpr { get { assert false; } } } /*--------------------------------------------------------------------------*/ CHARACTERS letter = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz". digit = "0123456789". special = "'~#$^_.?`". glyph = "`~!@#$%^&*()-_=+[{]}|;:',<.>/?\\". cr = '\r'. lf = '\n'. tab = '\t'. space = ' '. quote = '"'. nondigit = letter + special. nonquote = letter + digit + space + glyph. /*------------------------------------------------------------------------*/ TOKENS ident = [ '\\' ] nondigit {nondigit | digit}. bvlit = digit {digit} 'b' 'v' digit {digit}. digits = digit {digit}. string = quote {nonquote} quote. float = digit {digit} '.' {digit}. COMMENTS FROM "/*" TO "*/" NESTED COMMENTS FROM "//" TO lf IGNORE cr + lf + tab /*------------------------------------------------------------------------*/ PRODUCTIONS /*------------------------------------------------------------------------*/ BoogiePL = (. VariableSeq! vs; DeclarationSeq! ds; Axiom! ax; List! ts; Procedure! pr; Implementation im; Implementation! nnim; .) { Consts (. foreach (Bpl.Variable! v in vs) { Pgm.TopLevelDeclarations.Add(v); } .) | Function (. foreach (Bpl.Declaration! d in ds) { Pgm.TopLevelDeclarations.Add(d); } .) | Axiom (. Pgm.TopLevelDeclarations.Add(ax); .) | UserDefinedTypes (. foreach (Declaration! td in ts) { Pgm.TopLevelDeclarations.Add(td); } .) | GlobalVars (. foreach (Bpl.Variable! v in vs) { Pgm.TopLevelDeclarations.Add(v); } .) | Procedure (. Pgm.TopLevelDeclarations.Add(pr); if (im != null) { Pgm.TopLevelDeclarations.Add(im); } .) | Implementation (. Pgm.TopLevelDeclarations.Add(nnim); .) } EOF . /*------------------------------------------------------------------------*/ GlobalVars = (. TypedIdentSeq! tyds = new TypedIdentSeq(); ds = new VariableSeq(); QKeyValue kv = null; .) "var" { Attribute } IdsTypeWheres ";" (. foreach(TypedIdent! tyd in tyds) { ds.Add(new GlobalVariable(tyd.tok, tyd, kv)); } .) . LocalVars = (. TypedIdentSeq! tyds = new TypedIdentSeq(); QKeyValue kv = null; .) "var" { Attribute } IdsTypeWheres ";" (. foreach(TypedIdent! tyd in tyds) { ds.Add(new LocalVariable(tyd.tok, tyd, kv)); } .) . ProcFormals = (. TypedIdentSeq! tyds = new TypedIdentSeq(); ds = new VariableSeq(); .) "(" [ IdsTypeWheres ] ")" (. foreach (TypedIdent! tyd in tyds) { ds.Add(new Formal(tyd.tok, tyd, incoming)); } .) . BoundVars = (. TypedIdentSeq! tyds = new TypedIdentSeq(); ds = new VariableSeq(); .) IdsTypeWheres (. foreach (TypedIdent! tyd in tyds) { ds.Add(new BoundVariable(tyd.tok, tyd)); } .) . /*------------------------------------------------------------------------*/ /* IdsType is used with const declarations */ IdsType = (. TokenSeq! ids; Bpl.Type! ty; .) Idents ":" Type (. tyds = new TypedIdentSeq(); foreach (Token! id in ids) { tyds.Add(new TypedIdent(id, id.val, ty, null)); } .) . /* IdsTypeWheres is used with the declarations of global and local variables, procedure parameters, and quantifier bound variables. */ IdsTypeWheres = IdsTypeWhere { "," IdsTypeWhere } . IdsTypeWhere = (. TokenSeq! ids; Bpl.Type! ty; Expr wh = null; Expr! nne; .) Idents ":" Type [ "where" Expression (. if (allowWhereClauses) { wh = nne; } else { this.SemErr("where clause not allowed here"); } .) ] (. foreach (Token! id in ids) { tyds.Add(new TypedIdent(id, id.val, ty, wh)); } .) . /*------------------------------------------------------------------------*/ Type = (. IToken! tok; ty = dummyType; .) ( TypeAtom | Ident (. TypeSeq! args = new TypeSeq (); .) [ TypeArgs ] (. ty = new UnresolvedTypeIdentifier (tok, tok.val, args); .) | MapType ) . TypeArgs = (. IToken! tok; Type! ty; .) ( TypeAtom (. ts.Add(ty); .) [ TypeArgs ] | Ident (. TypeSeq! args = new TypeSeq (); ts.Add(new UnresolvedTypeIdentifier (tok, tok.val, args)); .) [ TypeArgs ] | MapType (. ts.Add(ty); .) ) . TypeAtom = (. ty = dummyType; .) ( "int" (. ty = new BasicType(t, SimpleType.Int); .) | "bool" (. ty = new BasicType(t, SimpleType.Bool); .) /* note: bitvectors are handled in UnresolvedTypeIdentifier */ | "(" Type ")" ) . MapType = (. IToken tok = null; IToken! nnTok; TypeSeq! arguments = new TypeSeq(); Type! result; TypeVariableSeq! typeParameters = new TypeVariableSeq(); .) [ TypeParams (. tok = nnTok; .) ] "[" (. if (tok == null) tok = t; .) [ Types ] "]" Type (. ty = new MapType(tok, typeParameters, arguments, result); .) . TypeParams = (. TokenSeq! typeParamToks; .) "<" (. tok = t; .) Idents ">" (. typeParams = new TypeVariableSeq (); foreach (Token! id in typeParamToks) typeParams.Add(new TypeVariable(id, id.val)); .) . Types = (. Bpl.Type! ty; .) Type (. ts.Add(ty); .) { "," Type (. ts.Add(ty); .) } . /*------------------------------------------------------------------------*/ Consts = (. IToken! y; TypedIdentSeq! xs; ds = new VariableSeq(); bool u = false; QKeyValue kv = null; bool ChildrenComplete = false; List Parents = null; .) "const" (. y = t; .) { Attribute } [ "unique" (. u = true; .) ] IdsType [ OrderSpec ] (. bool makeClone = false; foreach(TypedIdent! x in xs) { // ensure that no sharing is introduced List ParentsClone; if (makeClone && Parents != null) { ParentsClone = new List (); foreach (ConstantParent! p in Parents) ParentsClone.Add(new ConstantParent ( new IdentifierExpr (p.Parent.tok, p.Parent.Name), p.Unique)); } else { ParentsClone = Parents; } makeClone = true; ds.Add(new Constant(y, x, u, ParentsClone, ChildrenComplete, kv)); } .) ";" . OrderSpec<.out bool ChildrenComplete, out List Parents.> = (. ChildrenComplete = false; Parents = null; bool u; IToken! parent; .) "extends" (. Parents = new List (); u = false; .) [ [ "unique" (. u = true; .) ] Ident (. Parents.Add(new ConstantParent ( new IdentifierExpr(parent, parent.val), u)); .) { "," (. u = false; .) [ "unique" (. u = true; .) ] Ident (. Parents.Add(new ConstantParent ( new IdentifierExpr(parent, parent.val), u)); .) } ] [ "complete" (. ChildrenComplete = true; .) ] . /*------------------------------------------------------------------------*/ Function = (. ds = new DeclarationSeq(); IToken! z; IToken! typeParamTok; TypeVariableSeq! typeParams = new TypeVariableSeq(); VariableSeq arguments = new VariableSeq(); TypedIdent! tyd; TypedIdent retTyd = null; Type! retTy; QKeyValue kv = null; Expr definition = null; Expr! tmp; .) "function" { Attribute } Ident [ TypeParams ] "(" [ VarOrType (. arguments.Add(new Formal(tyd.tok, tyd, true)); .) { "," VarOrType (. arguments.Add(new Formal(tyd.tok, tyd, true)); .) } ] ")" ( "returns" "(" VarOrType ")" (. retTyd = tyd; .) | ":" Type (. retTyd = new TypedIdent(retTy.tok, "", retTy); .) ) ( "{" Expression (. definition = tmp; .) "}" | ";" ) (. if (retTyd == null) { // construct a dummy type for the case of syntax error tyd = new TypedIdent(t, "", new BasicType(t, SimpleType.Int)); } else { tyd = retTyd; } Function! func = new Function(z, z.val, typeParams, arguments, new Formal(tyd.tok, tyd, false), null, kv); ds.Add(func); bool allUnnamed = true; foreach (Formal! f in arguments) { if (f.TypedIdent.Name != "") { allUnnamed = false; break; } } if (!allUnnamed) { Type prevType = null; for (int i = arguments.Length - 1; i >= 0; i--) { TypedIdent! curr = ((!)arguments[i]).TypedIdent; if (curr.Name == "") { if (prevType == null) { this.errors.SemErr(curr.tok, "the type of the last parameter is unspecified"); break; } Type ty = curr.Type; if (ty is UnresolvedTypeIdentifier && ((!)(ty as UnresolvedTypeIdentifier)).Arguments.Length == 0) { curr.Name = ((!)(ty as UnresolvedTypeIdentifier)).Name; curr.Type = prevType; } else { this.errors.SemErr(curr.tok, "expecting an identifier as parameter name"); } } else { prevType = curr.Type; } } } if (definition != null) { // generate either an axiom or a function body if (QKeyValue.FindBoolAttribute(kv, "inline")) { func.Body = definition; } else { VariableSeq dummies = new VariableSeq(); ExprSeq callArgs = new ExprSeq(); int i = 0; foreach (Formal! f in arguments) { string nm = f.TypedIdent.HasName ? f.TypedIdent.Name : "_" + i; dummies.Add(new BoundVariable(f.tok, new TypedIdent(f.tok, nm, f.TypedIdent.Type))); callArgs.Add(new IdentifierExpr(f.tok, nm)); i++; } TypeVariableSeq! quantifiedTypeVars = new TypeVariableSeq (); foreach (TypeVariable! t in typeParams) quantifiedTypeVars.Add(new TypeVariable (Token.NoToken, t.Name)); Expr call = new NAryExpr(z, new FunctionCall(new IdentifierExpr(z, z.val)), callArgs); // specify the type of the function, because it might be that // type parameters only occur in the output type call = Expr.CoerceType(z, call, (Type)tyd.Type.Clone()); Expr def = Expr.Eq(call, definition); if (quantifiedTypeVars.Length != 0 || dummies.Length != 0) { def = new ForallExpr(z, quantifiedTypeVars, dummies, kv, new Trigger(z, true, new ExprSeq(call), null), def); } ds.Add(new Axiom(z, def, "autogenerated definition axiom", null)); } } .) . VarOrType = (. string! varName = ""; Bpl.Type! ty; IToken! tok; .) Type (. tok = ty.tok; .) [ ":" (. if (ty is UnresolvedTypeIdentifier && ((!)(ty as UnresolvedTypeIdentifier)).Arguments.Length == 0) { varName = ((!)(ty as UnresolvedTypeIdentifier)).Name; } else { this.SemErr("expected identifier before ':'"); } .) Type ] (. tyd = new TypedIdent(tok, varName, ty); .) . /*------------------------------------------------------------------------*/ Axiom = (. Expr! e; QKeyValue kv = null; .) "axiom" { Attribute } (. IToken! x = t; .) Proposition ";" (. m = new Axiom(x,e, null, kv); .) . /*------------------------------------------------------------------------*/ UserDefinedTypes<.out List! ts.> = (. Declaration! decl; QKeyValue kv = null; ts = new List (); .) "type" { Attribute } UserDefinedType (. ts.Add(decl); .) { "," UserDefinedType (. ts.Add(decl); .) } ";" . UserDefinedType = (. IToken! id; IToken! id2; TokenSeq! paramTokens = new TokenSeq (); Type! body = dummyType; bool synonym = false; .) Ident [ WhiteSpaceIdents ] [ "=" Type (. synonym = true; .) ] (. if (synonym) { TypeVariableSeq! typeParams = new TypeVariableSeq(); foreach (Token! t in paramTokens) typeParams.Add(new TypeVariable(t, t.val)); decl = new TypeSynonymDecl(id, id.val, typeParams, body, kv); } else { decl = new TypeCtorDecl(id, id.val, paramTokens.Length, kv); } .) . /*------------------------------------------------------------------------*/ Procedure = (. IToken! x; TypeVariableSeq! typeParams; VariableSeq! ins, outs; RequiresSeq! pre = new RequiresSeq(); IdentifierExprSeq! mods = new IdentifierExprSeq(); EnsuresSeq! post = new EnsuresSeq(); VariableSeq! locals = new VariableSeq(); StmtList! stmtList; QKeyValue kv = null; impl = null; .) "procedure" ProcSignature ( ";" { Spec } | { Spec } ImplBody (. // here we attach kv only to the Procedure, not its implementation impl = new Implementation(x, x.val, typeParams, Formal.StripWhereClauses(ins), Formal.StripWhereClauses(outs), locals, stmtList, null, this.errors); .) ) (. proc = new Procedure(x, x.val, typeParams, ins, outs, pre, mods, post, kv); .) . Implementation = (. IToken! x; TypeVariableSeq! typeParams; VariableSeq! ins, outs; VariableSeq! locals; StmtList! stmtList; QKeyValue kv; .) "implementation" ProcSignature ImplBody (. impl = new Implementation(x, x.val, typeParams, ins, outs, locals, stmtList, kv, this.errors); .) . ProcSignature = (. IToken! typeParamTok; typeParams = new TypeVariableSeq(); outs = new VariableSeq(); kv = null; .) { Attribute } Ident [ TypeParams ] ProcFormals [ "returns" ProcFormals ] . Spec = (. TokenSeq! ms; .) ( "modifies" [ Idents (. foreach (IToken! m in ms) { mods.Add(new IdentifierExpr(m, m.val)); } .) ] ";" | "free" SpecPrePost | SpecPrePost ) . SpecPrePost = (. Expr! e; VariableSeq! locals; BlockSeq! blocks; Token tok = null; QKeyValue kv = null; .) ( "requires" (. tok = t; .) { Attribute } Proposition ";" (. pre.Add(new Requires(tok, free, e, null, kv)); .) | "ensures" (. tok = t; .) { Attribute } Proposition ";" (. post.Add(new Ensures(tok, free, e, null, kv)); .) ) . /*------------------------------------------------------------------------*/ ImplBody = (. locals = new VariableSeq(); .) "{" { LocalVars } StmtList . /* the StmtList also reads the final curly brace */ StmtList = (. List bigblocks = new List(); /* built-up state for the current BigBlock: */ IToken startToken = null; string currentLabel = null; CmdSeq cs = null; /* invariant: startToken != null ==> cs != null */ /* temporary variables: */ IToken label; Cmd c; BigBlock b; StructuredCmd ec = null; StructuredCmd! ecn; TransferCmd tc = null; TransferCmd! tcn; .) { ( LabelOrCmd (. if (c != null) { // LabelOrCmd read a Cmd assert label == null; if (startToken == null) { startToken = c.tok; cs = new CmdSeq(); } assert cs != null; cs.Add(c); } else { // LabelOrCmd read a label assert label != null; if (startToken != null) { assert cs != null; // dump the built-up state into a BigBlock b = new BigBlock(startToken, currentLabel, cs, null, null); bigblocks.Add(b); cs = null; } startToken = label; currentLabel = label.val; cs = new CmdSeq(); } .) | StructuredCmd (. ec = ecn; if (startToken == null) { startToken = ec.tok; cs = new CmdSeq(); } assert cs != null; b = new BigBlock(startToken, currentLabel, cs, ec, null); bigblocks.Add(b); startToken = null; currentLabel = null; cs = null; .) | TransferCmd (. tc = tcn; if (startToken == null) { startToken = tc.tok; cs = new CmdSeq(); } assert cs != null; b = new BigBlock(startToken, currentLabel, cs, null, tc); bigblocks.Add(b); startToken = null; currentLabel = null; cs = null; .) ) } "}" (. IToken! endCurly = t; if (startToken == null && bigblocks.Count == 0) { startToken = t; cs = new CmdSeq(); } if (startToken != null) { assert cs != null; b = new BigBlock(startToken, currentLabel, cs, null, null); bigblocks.Add(b); } stmtList = new StmtList(bigblocks, endCurly); .) . TransferCmd = (. tc = dummyTransferCmd; Token y; TokenSeq! xs; StringSeq ss = new StringSeq(); .) ( "goto" (. y = t; .) Idents (. foreach (IToken! s in xs) { ss.Add(s.val); } tc = new GotoCmd(y, ss); .) | "return" (. tc = new ReturnCmd(t); .) ) ";" . StructuredCmd = (. ec = dummyStructuredCmd; assume ec.IsPeerConsistent; IfCmd! ifcmd; WhileCmd! wcmd; BreakCmd! bcmd; .) ( IfCmd (. ec = ifcmd; .) | WhileCmd (. ec = wcmd; .) | BreakCmd (. ec = bcmd; .) ) . IfCmd = (. IToken! x; Expr guard; StmtList! thn; IfCmd! elseIf; IfCmd elseIfOption = null; StmtList! els; StmtList elseOption = null; .) "if" (. x = t; .) Guard "{" StmtList [ "else" ( IfCmd (. elseIfOption = elseIf; .) | "{" StmtList (. elseOption = els; .) ) ] (. ifcmd = new IfCmd(x, guard, thn, elseIfOption, elseOption); .) . WhileCmd = (. IToken! x; Token z; Expr guard; Expr! e; bool isFree; List invariants = new List(); StmtList! body; .) "while" (. x = t; .) Guard (. assume guard == null || Owner.None(guard); .) { (. isFree = false; z = la/*lookahead token*/; .) [ "free" (. isFree = true; .) ] "invariant" Expression (. if (isFree) { invariants.Add(new AssumeCmd(z, e)); } else { invariants.Add(new AssertCmd(z, e)); } .) ";" } "{" StmtList (. wcmd = new WhileCmd(x, guard, invariants, body); .) . Guard = (. Expr! ee; e = null; .) "(" ( "*" (. e = null; .) | Expression (. e = ee; .) ) ")" . BreakCmd = (. IToken! x; IToken! y; string breakLabel = null; .) "break" (. x = t; .) [ Ident (. breakLabel = y.val; .) ] ";" (. bcmd = new BreakCmd(x, breakLabel); .) . /*------------------------------------------------------------------------*/ LabelOrCmd /* ensures (c == null) != (label != null) */ = (. IToken! x; Expr! e; TokenSeq! xs; IdentifierExprSeq ids; c = dummyCmd; label = null; Cmd! cn; QKeyValue kv = null; .) ( LabelOrAssign | "assert" (. x = t; .) { Attribute } Proposition (. c = new AssertCmd(x,e, kv); .) ";" | "assume" (. x = t; .) Proposition (. c = new AssumeCmd(x,e); .) ";" | "havoc" (. x = t; .) Idents ";" (. ids = new IdentifierExprSeq(); foreach (IToken! y in xs) { ids.Add(new IdentifierExpr(y, y.val)); } c = new HavocCmd(x,ids); .) | CallCmd ";" (. c = cn; .) ) . /*------------------------------------------------------------------------*/ LabelOrAssign /* ensures (c == null) != (label != null) */ = (. IToken! id; IToken! x, y; Expr! e, e0; c = dummyCmd; label = null; AssignLhs! lhs; List! lhss; List! rhss; List! indexes; .) Ident (. x = t; .) ( ":" (. c = null; label = x; .) | (. lhss = new List(); .) (. lhs = new SimpleAssignLhs(id, new IdentifierExpr(id, id.val)); .) { MapAssignIndex (. lhs = new MapAssignLhs(y, lhs, indexes); .) } (. lhss.Add(lhs); .) { "," Ident (. lhs = new SimpleAssignLhs(id, new IdentifierExpr(id, id.val)); .) { MapAssignIndex (. lhs = new MapAssignLhs(y, lhs, indexes); .) } (. lhss.Add(lhs); .) } ":=" (. x = t; /* use location of := */ .) Expression (. rhss = new List (); rhss.Add(e0); .) { "," Expression (. rhss.Add(e0); .) } ";" (. c = new AssignCmd(x, lhss, rhss); .) ) . MapAssignIndex<.out IToken! x, out List! indexes.> = (. indexes = new List (); Expr! e; .) "[" (. x = t; .) [ Expression (. indexes.Add(e); .) { "," Expression (. indexes.Add(e); .) } ] "]" . /*------------------------------------------------------------------------*/ CallCmd = (. IToken! x; IToken! first; IToken p; List! ids = new List(); List! es = new List(); QKeyValue kv = null; Expr en; List args; c = dummyCmd; .) "call" (. x = t; .) { Attribute } ( Ident ( "(" [ CallForallArg (. es.Add(en); .) { "," CallForallArg (. es.Add(en); .) } ] ")" (. c = new CallCmd(x, first.val, es, ids, kv); .) | (. ids.Add(new IdentifierExpr(first, first.val)); .) [ "," CallOutIdent (. if (p==null) { ids.Add(null); } else { ids.Add(new IdentifierExpr(p, p.val)); } .) { "," CallOutIdent (. if (p==null) { ids.Add(null); } else { ids.Add(new IdentifierExpr(p, p.val)); } .) } ] ":=" Ident "(" [ CallForallArg (. es.Add(en); .) { "," CallForallArg (. es.Add(en); .) } ] ")" (. c = new CallCmd(x, first.val, es, ids, kv); .) ) | "forall" Ident "(" (. args = new List(); .) [ CallForallArg (. args.Add(en); .) { "," CallForallArg (. args.Add(en); .) } ] ")" (. c = new CallForallCmd(x, first.val, args, kv); .) | "*" (. ids.Add(null); .) [ "," CallOutIdent (. if (p==null) { ids.Add(null); } else { ids.Add(new IdentifierExpr(p, p.val)); } .) { "," CallOutIdent (. if (p==null) { ids.Add(null); } else { ids.Add(new IdentifierExpr(p, p.val)); } .) } ] ":=" Ident "(" [ CallForallArg (. es.Add(en); .) { "," CallForallArg (. es.Add(en); .) } ] ")" (. c = new CallCmd(x, first.val, es, ids, kv); .) ) . CallOutIdent = (. id = null; IToken! p; .) ( "*" | Ident (. id = p; .) ) . CallForallArg = (. exprOptional = null; Expr! e; .) ( "*" | Expression (. exprOptional = e; .) ) . /*------------------------------------------------------------------------*/ Proposition = Expression . /*------------------------------------------------------------------------*/ Idents = (. IToken! id; xs = new TokenSeq(); .) Ident (. xs.Add(id); .) { "," Ident (. xs.Add(id); .) } . /*------------------------------------------------------------------------*/ WhiteSpaceIdents = (. IToken! id; xs = new TokenSeq(); .) Ident (. xs.Add(id); .) { Ident (. xs.Add(id); .) } . /*------------------------------------------------------------------------*/ Expressions = (. Expr! e; es = new ExprSeq(); .) Expression (. es.Add(e); .) { "," Expression (. es.Add(e); .) } . /*------------------------------------------------------------------------*/ Expression = (. IToken! x; Expr! e1; .) ImpliesExpression { EquivOp (. x = t; .) ImpliesExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.Iff, e0, e1); .) } . EquivOp = "<==>" | '\u21d4'. /*------------------------------------------------------------------------*/ ImpliesExpression = (. IToken! x; Expr! e1; .) LogicalExpression [ ImpliesOp (. x = t; .) /* recurse because implication is right-associative */ ImpliesExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.Imp, e0, e1); .) | ExpliesOp (. if (noExplies) this.SemErr("illegal mixture of ==> and <==, use parentheses to disambiguate"); x = t; .) LogicalExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.Imp, e1, e0); .) /* loop because explies is left-associative */ { ExpliesOp (. x = t; .) LogicalExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.Imp, e1, e0); .) } ] . ImpliesOp = "==>" | '\u21d2'. ExpliesOp = "<==" | '\u21d0'. /*------------------------------------------------------------------------*/ LogicalExpression = (. IToken! x; Expr! e1; BinaryOperator.Opcode op; .) RelationalExpression [ AndOp (. x = t; .) RelationalExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.And, e0, e1); .) { AndOp (. x = t; .) RelationalExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.And, e0, e1); .) } | OrOp (. x = t; .) RelationalExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.Or, e0, e1); .) { OrOp (. x = t; .) RelationalExpression (. e0 = Expr.Binary(x, BinaryOperator.Opcode.Or, e0, e1); .) } ] . AndOp = "&&" | '\u2227'. OrOp = "||" | '\u2228'. /*------------------------------------------------------------------------*/ RelationalExpression = (. IToken! x; Expr! e1; BinaryOperator.Opcode op; .) BvTerm [ RelOp BvTerm (. e0 = Expr.Binary(x, op, e0, e1); .) ] . RelOp = (. x = Token.NoToken; op=BinaryOperator.Opcode.Add/*(dummy)*/; .) ( "==" (. x = t; op=BinaryOperator.Opcode.Eq; .) | "<" (. x = t; op=BinaryOperator.Opcode.Lt; .) | ">" (. x = t; op=BinaryOperator.Opcode.Gt; .) | "<=" (. x = t; op=BinaryOperator.Opcode.Le; .) | ">=" (. x = t; op=BinaryOperator.Opcode.Ge; .) | "!=" (. x = t; op=BinaryOperator.Opcode.Neq; .) | "<:" (. x = t; op=BinaryOperator.Opcode.Subtype; .) | '\u2260' (. x = t; op=BinaryOperator.Opcode.Neq; .) | '\u2264' (. x = t; op=BinaryOperator.Opcode.Le; .) | '\u2265' (. x = t; op=BinaryOperator.Opcode.Ge; .) ) . /*------------------------------------------------------------------------*/ BvTerm = (. IToken! x; Expr! e1; .) Term { "++" (. x = t; .) Term (. e0 = new BvConcatExpr(x, e0, e1); .) } . /*------------------------------------------------------------------------*/ Term = (. IToken! x; Expr! e1; BinaryOperator.Opcode op; .) Factor { AddOp Factor (. e0 = Expr.Binary(x, op, e0, e1); .) } . AddOp = (. x = Token.NoToken; op=BinaryOperator.Opcode.Add/*(dummy)*/; .) ( "+" (. x = t; op=BinaryOperator.Opcode.Add; .) | "-" (. x = t; op=BinaryOperator.Opcode.Sub; .) ) . /*------------------------------------------------------------------------*/ Factor = (. IToken! x; Expr! e1; BinaryOperator.Opcode op; .) UnaryExpression { MulOp UnaryExpression (. e0 = Expr.Binary(x, op, e0, e1); .) } . MulOp = (. x = Token.NoToken; op=BinaryOperator.Opcode.Add/*(dummy)*/; .) ( "*" (. x = t; op=BinaryOperator.Opcode.Mul; .) | "/" (. x = t; op=BinaryOperator.Opcode.Div; .) | "%" (. x = t; op=BinaryOperator.Opcode.Mod; .) ) . /*------------------------------------------------------------------------*/ UnaryExpression = (. IToken! x; e = dummyExpr; .) ( "-" (. x = t; .) UnaryExpression (. e = Expr.Binary(x, BinaryOperator.Opcode.Sub, new LiteralExpr(x, BigNum.ZERO), e); .) | NegOp (. x = t; .) UnaryExpression (. e = Expr.Unary(x, UnaryOperator.Opcode.Not, e); .) | CoercionExpression ) . NegOp = "!" | '\u00ac'. /*------------------------------------------------------------------------*/ /* This production creates ambiguities, because types can start with "<" (polymorphic map types), but can also be followed by "<" (inequalities). Coco deals with these ambiguities in a reasonable way by preferring to read further types (type arguments) over relational symbols. E.g., "5 : C < 0" will cause a parse error because "<" is treated as the beginning of a map type. */ CoercionExpression = (. IToken! x; Type! coercedTo; BigNum bn; .) ArrayExpression { ":" (. x = t; .) ( Type (. e = Expr.CoerceType(x, e, coercedTo); .) | Nat /* This means that we really look at a bitvector expression t[a:b] */ (. if (!(e is LiteralExpr) || !((LiteralExpr)e).isBigNum) { this.SemErr("arguments of extract need to be integer literals"); e = new BvBounds(x, bn, BigNum.ZERO); } else { e = new BvBounds(x, bn, ((LiteralExpr)e).asBigNum); } .) ) } . /*------------------------------------------------------------------------*/ ArrayExpression = (. IToken! x; Expr! index0 = dummyExpr; Expr! e1; bool store; bool bvExtract; ExprSeq! allArgs = dummyExprSeq; .) AtomExpression { "[" (. x = t; allArgs = new ExprSeq (); allArgs.Add(e); store = false; bvExtract = false; .) [ Expression (. if (index0 is BvBounds) bvExtract = true; else allArgs.Add(index0); .) { "," Expression (. if (bvExtract || e1 is BvBounds) this.SemErr("bitvectors only have one dimension"); allArgs.Add(e1); .) } [ ":=" Expression (. if (bvExtract || e1 is BvBounds) this.SemErr("assignment to bitvectors is not possible"); allArgs.Add(e1); store = true; .) ] | ":=" Expression (. allArgs.Add(e1); store = true; .) ] "]" (. if (store) e = new NAryExpr(x, new MapStore(x, allArgs.Length - 2), allArgs); else if (bvExtract) e = new BvExtractExpr(x, e, ((BvBounds)index0).Upper.ToIntSafe, ((BvBounds)index0).Lower.ToIntSafe); else e = new NAryExpr(x, new MapSelect(x, allArgs.Length - 1), allArgs); .) } . /*------------------------------------------------------------------------*/ AtomExpression = (. IToken! x; int n; BigNum bn; ExprSeq! es; VariableSeq! ds; Trigger trig; TypeVariableSeq! typeParams; IdentifierExpr! id; Bpl.Type! ty; QKeyValue kv; e = dummyExpr; VariableSeq! locals; List! blocks; .) ( "false" (. e = new LiteralExpr(t, false); .) | "true" (. e = new LiteralExpr(t, true); .) | Nat (. e = new LiteralExpr(t, bn); .) | BvLit (. e = new LiteralExpr(t, bn, n); .) | Ident (. id = new IdentifierExpr(x, x.val); e = id; .) [ "(" ( Expressions (. e = new NAryExpr(x, new FunctionCall(id), es); .) | /* empty */ (. e = new NAryExpr(x, new FunctionCall(id), new ExprSeq()); .) ) ")" ] | "old" (. x = t; .) "(" Expression ")" (. e = new OldExpr(x, e); .) | "(" ( Expression (. if (e is BvBounds) this.SemErr("parentheses around bitvector bounds " + "are not allowed"); .) | Forall (. x = t; .) QuantifierBody (. if (typeParams.Length + ds.Length > 0) e = new ForallExpr(x, typeParams, ds, kv, trig, e); .) | Exists (. x = t; .) QuantifierBody (. if (typeParams.Length + ds.Length > 0) e = new ExistsExpr(x, typeParams, ds, kv, trig, e); .) | Lambda (. x = t; .) QuantifierBody (. if (trig != null) SemErr("triggers not allowed in lambda expressions"); if (typeParams.Length + ds.Length > 0) e = new LambdaExpr(x, typeParams, ds, kv, e); .) ) ")" | IfThenElseExpression | CodeExpression (. e = new CodeExpr(locals, blocks); .) ) . CodeExpression<.out VariableSeq! locals, out List! blocks.> = (. locals = new VariableSeq(); Block! b; blocks = new List(); .) "|{" { LocalVars } SpecBlock (. blocks.Add(b); .) { SpecBlock (. blocks.Add(b); .) } "}|" . SpecBlock = (. IToken! x; IToken! y; Cmd c; IToken label; CmdSeq cs = new CmdSeq(); TokenSeq! xs; StringSeq ss = new StringSeq(); b = dummyBlock; Expr! e; .) Ident ":" { LabelOrCmd (. if (c != null) { assert label == null; cs.Add(c); } else { assert label != null; SemErr("SpecBlock's can only have one label"); } .) } ( "goto" (. y = t; .) Idents (. foreach (IToken! s in xs) { ss.Add(s.val); } b = new Block(x,x.val,cs,new GotoCmd(y,ss)); .) | "return" Expression (. b = new Block(x,x.val,cs,new ReturnExprCmd(t,e)); .) ) ";" . Attribute = (. Trigger trig = null; .) AttributeOrTrigger (. if (trig != null) this.SemErr("only attributes, not triggers, allowed here"); .) . AttributeOrTrigger = (. IToken! tok; Expr! e; ExprSeq! es; string key; string value; List parameters; object! param; .) "{" (. tok = t; .) ( ":" ident (. key = t.val; parameters = new List(); .) [ AttributeParameter (. parameters.Add(param); .) { "," AttributeParameter (. parameters.Add(param); .) } ] (. if (key == "nopats") { if (parameters.Count == 1 && parameters[0] is Expr) { e = (Expr)parameters[0]; if(trig==null){ trig = new Trigger(tok, false, new ExprSeq(e), null); } else { trig.AddLast(new Trigger(tok, false, new ExprSeq(e), null)); } } else { this.SemErr("the 'nopats' quantifier attribute expects a string-literal parameter"); } } else { if (kv==null) { kv = new QKeyValue(tok, key, parameters, null); } else { kv.AddLast(new QKeyValue(tok, key, parameters, null)); } } .) | Expression (. es = new ExprSeq(e); .) { "," Expression (. es.Add(e); .) } (. if (trig==null) { trig = new Trigger(tok, true, es, null); } else { trig.AddLast(new Trigger(tok, true, es, null)); } .) ) "}" . AttributeParameter = (. o = "error"; Expr! e; .) ( string (. o = t.val.Substring(1, t.val.Length-2); .) | Expression (. o = e; .) ) . IfThenElseExpression = (. IToken! tok; Expr! e0, e1, e2; e = dummyExpr; .) "if" (. tok = t; .) Expression "then" Expression "else" Expression (. e = new NAryExpr(tok, new IfThenElse(tok), new ExprSeq(e0, e1, e2)); .) . QuantifierBody = (. trig = null; typeParams = new TypeVariableSeq (); IToken! tok; Expr! e; ExprSeq! es; kv = null; string key; string value; ds = new VariableSeq (); .) ( TypeParams [ BoundVars ] | BoundVars ) QSep { AttributeOrTrigger } Expression . Forall = "forall" | '\u2200'. Exists = "exists" | '\u2203'. Lambda = "lambda" | '\u03bb'. QSep = "::" | '\u2022'. /*------------------------------------------------------------------------*/ Ident = ident (. x = t; if (x.val.StartsWith("\\")) x.val = x.val.Substring(1); .) . /*------------------------------------------------------------------------*/ Nat = digits (. try { n = BigNum.FromString(t.val); } catch (FormatException) { this.SemErr("incorrectly formatted number"); n = BigNum.ZERO; } .) . /*------------------------------------------------------------------------*/ BvLit = bvlit (. int pos = t.val.IndexOf("bv"); string a = t.val.Substring(0, pos); string b = t.val.Substring(pos + 2); try { n = BigNum.FromString(a); m = Convert.ToInt32(b); } catch (FormatException) { this.SemErr("incorrectly formatted bitvector"); n = BigNum.ZERO; m = 0; } .) . END BoogiePL.