1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938
|
#!/bin/env python
# Author(s): Jeroen Keiren
# Copyright: see the accompanying file COPYING or copy at
# https://svn.win.tue.nl/trac/MCRL2/browser/trunk/COPYING
#
# Distributed under the Boost Software License, Version 1.0.
# (See accompanying file LICENSE_1_0.txt or copy at
# http://www.boost.org/LICENSE_1_0.txt)
# Based on earlier work by Jason Evans
#===============================================================================
# Copyright (c) 2007 Jason Evans <jasone@canonware.com>
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
#
#===============================================================================
#
# Usage: codegen.py [-v] "<input> <output>"
# <input> is a filename
# <output> is a filename
#
#===============================================================================
import sys
import re
import os
import string
from optparse import OptionParser
import Parsing
import copy
from data import *
context = None
current_file = ""
# Verbose printing of message
def printVerbose(string, object):
if verbose:
print("%s: %s" % (string, str(object)))
#===============================================================================
# Tokens/precedences.
# Precedences
# -> Associates to the right
class PArrow(Parsing.Precedence):
"%right pArrow"
# # associates to the left
class PHash(Parsing.Precedence):
"%left pHash"
# Tokens
# ->
class TokenArrow(Parsing.Token):
"%token arrow [pArrow]"
# #
class TokenHash(Parsing.Token):
"%token hash [pHash]"
# |
class TokenMid(Parsing.Token):
"%token mid"
# #include
class TokenInclude(Parsing.Token):
"%token include"
# #include
class TokenSupertypeOf(Parsing.Token):
"%token supertypeof"
# :
class TokenColon(Parsing.Token):
"%token colon"
# ;
class TokenSemiColon(Parsing.Token):
"%token semicolon"
# ,
class TokenComma(Parsing.Token):
"%token comma"
# (
class TokenLBrack(Parsing.Token):
"%token lbrack"
# )
class TokenRBrack(Parsing.Token):
"%token rbrack"
# <
class TokenLAng(Parsing.Token):
"%token lang"
# >
class TokenRAng(Parsing.Token):
"%token rang"
# =
class TokenEquals(Parsing.Token):
"%token equals"
# using token to define sort parameter
class TokenUsing(Parsing.Token):
"%token using"
# sort
class TokenSort(Parsing.Token):
"%token sort"
# struct
class TokenStruct(Parsing.Token):
"%token struct"
# cons
class TokenCons(Parsing.Token):
"%token cons"
# map
class TokenMap(Parsing.Token):
"%token map"
# var
class TokenVar(Parsing.Token):
"%token var"
# eqn
class TokenEqn(Parsing.Token):
"%token eqn"
# lambda
class TokenLambda(Parsing.Token):
"%token lambda"
# forall
class TokenForall(Parsing.Token):
"%token forall"
# exists
class TokenExists(Parsing.Token):
"%token exists"
# identifiers
class TokenID(Parsing.Token):
"%token id"
def __init__(self, parser, s):
Parsing.Token.__init__(self, parser)
self.data = identifier(s)
def __str__():
return str(self.data)
#===============================================================================
# Nonterminals, with associated productions. In traditional BNF, the following
# productions would look something like:
# Result ::= UsingSpec
# UsingSpec ::= "using UsingList IncludesSpec
# | IncludesSpec
# UsingList ::= ID
# | UsingSpec ID
# IncludesSpec ::= SubTypeSpec
# | Includes SubTypeSpec
# Includes ::= Include
# | Includes Include
# Include ::= "#include" ID
# SubTypeSpec ::= Spec
# | SubTypes Spec
# Subtypes ::= Subtype
# | Subtypes Subtype
# Subtype ::= "#supertypeof" ID
# Spec ::= SortSpec FunctionSpec VarSpec EqnSpec
# SortSpec ::= "sort" SortDecls
# FunctionSpec ::= MapSpec
# | ConsSpec MapSpec
# ConsSpec ::= "cons" OpDecls
# MapSpec ::= "map" OpDecls
# VarSpec ::= "var" VarDecls
# EqnSpec ::= "eqn" EqnDecls
# SortDecls ::= SortDecl
# | SortDecls SortDecl
# SortDecl ::= SortExpr Label
# | ID "(" SortParam ")" Label
# | ID "(" SortParam ")" Label = StructSpec
# StructSpec ::= "struct" StructDecls
# StructDecls ::= StructDecl |
# StructDecl StructDecls
# StructDecl ::= ID Label |
# ID Label ":" Domain
# VarDecls ::= VarDecl
# | VarDecls VarDecl
# VarDecl ::= ID ":" SortExpr
# OpDecls ::= OpDecl
# | OpDecls OpDecl
# OpDecl ::= ID Label ":" SortExpr
# EqnDecls ::= EqnDecl
# | EqnDecls EqnDecl
# EqnDecl ::= DataExpr "=" DataExpr
# DataExpr ::= DataExprPrimary
# | DataExpr "(" DataExprs ")"
# | lambda(VarDecl, DataExpr)
# | forall(VarDecls, DataExpr)
# | exists(VarDecls, DataExpr)
# DataExprPrimary ::= ID
# | "(" DataExpr ")"
# DataExprs ::= DataExpr
# | DataExprs "," DataExpr
# SortExpr ::= SortExprPrimary
# | LabelledDomain -> SortExpr
# | Domain -> SortExpr
# | ID "(" SortParam ")"
# SortParam ::= ID
# LabelledDomain ::= SortExprPrimary Label
# | LabelledDomain # SortExprPrimary Label
# Domain ::= SortExprPrimary Label
# | Domain # SortExprPrimary Label
# SortExprPrimary ::= ID
# | LPAR SortExpr RPAR
# Label ::= LANG ID RANG
# Result ::= Spec
# | Using Spec
class Result(Parsing.Nonterm):
"%start"
def reduceUsingSpec(self, result):
"%reduce UsingSpec"
global context
global current_file
self.data = result.data
self.data.set_namespace()
self.data.set_origin_file(current_file)
if context == None:
context = self.data
else:
self.data.merge_specification(context)
context = self.data
class UsingSpec(Parsing.Nonterm):
"%nonterm"
def reduceIncludesSpec(self, result):
"%reduce IncludesSpec"
self.data = result.data
def reduceUsing(self, usinglist, spec):
"%reduce UsingList IncludesSpec"
self.data = spec.data
self.data.set_using(usinglist.data)
class UsingList(Parsing.Nonterm):
"%nonterm"
def reduceId(self, u, result):
"%reduce using id"
self.data = using_list([using(result.data)])
def reduceUsingList(self, usinglist, u, result):
"%reduce UsingList using id"
self.data = usinglist.data
self.data.push_back(using(result.data))
# IncludesSpec ::= SubtypeSpec
# | Includes SubtypeSpec
class IncludesSpec(Parsing.Nonterm):
"%nonterm"
def reduceSubtypeSpec(self, spec):
"%reduce SubtypeSpec"
self.data = spec.data
printVerbose("IncludesSpec", self.data)
def reduceIncludesSpec(self, includes, spec):
"%reduce Includes SubtypeSpec"
self.data = spec.data
self.data.set_includes(includes.data)
printVerbose("IncludesSpec", self.data)
# Includes ::= Include
# | Includes Include
class Includes(Parsing.Nonterm):
"%nonterm"
def reduceInclude(self, incl):
"%reduce Include"
self.data = include_list([incl.data])
printVerbose("Includes", self.data)
def reduceIncludes(self, includes, include):
"%reduce Includes Include"
self.data = includes.data
self.data.push_back(include.data)
printVerbose("Includes", self.data)
# Include ::= "#include" ID
class Include(Parsing.Nonterm):
"%nonterm"
def reduceInclude(self, incl, id):
"%reduce include id"
self.data = include(id.data)
printVerbose("Include", self.data)
# SubtypesSpec ::= SubtypeSpec
# | Subtypes SubtypeSpec
class SubtypeSpec(Parsing.Nonterm):
"%nonterm"
def reduceSpec(self, spec):
"%reduce Spec"
self.data = spec.data
printVerbose("SubtypesSpec", self.data)
def reduceSubtypesSpec(self, subtypes, spec):
"%reduce Subtypes Spec"
self.data = spec.data
self.data.set_subtypes(subtypes.data)
printVerbose("SubtypesSpec", self.data)
# Subtypes ::= Subtype
# | Subtypes Subtype
class Subtypes(Parsing.Nonterm):
"%nonterm"
def reduceSubtype(self, subtype):
"%reduce Subtype"
self.data = subtype_list([subtype.data])
printVerbose("Subtypes", self.data)
def reduceSubtypes(self, subtypes, subtype):
"%reduce Subtypes Subtype"
self.data = subtypes.data
self.data.push_back(subtype.data)
printVerbose("Subtypes", self.data)
# Subtype ::= "#sypertypeof" ID
class Subtype(Parsing.Nonterm):
"%nonterm"
def reduceSubtype(self, supertypeof, id):
"%reduce supertypeof id"
self.data = subtype(id.data)
printVerbose("Subtype", self.data)
# Spec ::= SortSpec FunctionSpec VarSpec EqnSpec
class Spec(Parsing.Nonterm):
"%nonterm"
def reduce(self, sortspecfunctionspec, varspec, eqnspec):
"%reduce OptionalSortSpecFunctionSpec VarSpec EqnSpec"
self.data = specification(sortspecfunctionspec.sortspec, sortspecfunctionspec.functionspec, varspec.data, eqnspec.data)
printVerbose("Spec", self.data)
class OptionalSortSpecFunctionSpec(Parsing.Nonterm):
"%nonterm"
def reduceFunctionSpec(self, functionspec):
"%reduce FunctionSpec"
self.functionspec = functionspec.data
self.sortspec = sort_specification(sort_declaration_list([]))
def reduceSortSpecFunctionSpec(self, sortspec, functionspec):
"%reduce SortSpec FunctionSpec"
self.sortspec = sortspec.data
self.functionspec = functionspec.data
# SortSpec ::= "sort" SortDecls
class SortSpec(Parsing.Nonterm):
"%nonterm"
def reduceSortSpec(self, sort, sortdecls):
"%reduce sort SortDecls"
self.data = sort_specification(sortdecls.data)
printVerbose("SortSpec", self.data)
# FunctionSpec ::= MapSpec
# | ConsSpec MapSpec
class FunctionSpec(Parsing.Nonterm):
"%nonterm"
def reduceConsMapSpec(self, consspec, mapspec):
"%reduce ConsSpec MapSpec"
self.data = function_specification(mapspec.data, consspec.data)
printVerbose("FunctionSpec", self.data)
def reduceMapSpec(self, mapspec):
"%reduce MapSpec"
self.data = function_specification(mapspec.data, constructor_specification(function_declaration_list([])))
printVerbose("FunctionSpec", self.data)
# ConsSpec ::= "cons" OpDecls
class ConsSpec(Parsing.Nonterm):
"%nonterm"
def reduceConsSpec(self, cons, opdecls):
"%reduce cons OpDecls"
self.data = constructor_specification(opdecls.data)
printVerbose("ConsSpec", self.data)
# MapSpec ::= "map" OpDecls
class MapSpec(Parsing.Nonterm):
"%nonterm"
def reduceMapSpec(self, map, opdecls):
"%reduce map OpDecls"
self.data = mapping_specification(opdecls.data)
printVerbose("MapSpec", self.data)
# VarSpec ::= "var" VarDecls
class VarSpec(Parsing.Nonterm):
"%nonterm"
def reduceVarSpec(self, var, vardecls):
"%reduce var VarDecls"
self.data = variable_specification(vardecls.data)
printVerbose("VarSpec", self.data)
# EqnSpec ::= "eqn" EqnDecls
class EqnSpec(Parsing.Nonterm):
"%nonterm"
def reduceEqnSpec(self, eqn, eqndecls):
"%reduce eqn EqnDecls"
self.data = equation_specification(eqndecls.data)
printVerbose("EqnSpec", self.data)
# SortDecls ::= SortDecl
# | SortDecls SortDecl
class SortDecls(Parsing.Nonterm):
"%nonterm"
def reduceSortDecl(self, sortdecl, semicolon):
"%reduce SortDecl semicolon"
self.data = sort_declaration_list([sortdecl.data])
printVerbose("SortDecls", self.data)
def reduceSortDecls(self, sortdecls, sortdecl, semicolon):
"%reduce SortDecls SortDecl semicolon"
self.data = sortdecls.data
self.data.push_back(sortdecl.data)
printVerbose("SortDecls", self.data)
# SortDecl ::= SortExpr Label
# | ID "(" SortParam ")" Label
# | ID "(" SortParam ")" Label = StructSpec
class SortDecl(Parsing.Nonterm):
"%nonterm"
def reduceSortDecl(self, sortexpr, label):
"%reduce id Label"
self.data = sort_declaration(sort_identifier(sortexpr.data), label.data)
printVerbose("SortDecl", self.data)
def reduceSortDeclParam(self, container, lbrack, param, rbrack, label):
"%reduce id lbrack SortParam rbrack Label"
self.data = sort_declaration(sort_container(container.data, param.data), label.data)
printVerbose("SortDecl", self.data)
def reduceSortAliasParam(self, container, lbrack, param, rbrack, label, equals, struct):
"%reduce id lbrack SortParam rbrack Label equals StructSpec"
self.data = sort_declaration(sort_container(container.data, param.data), label.data, struct.data)
printVerbose("SortDecl", self.data)
# StructSpec ::= "struct" StructDecls
class StructSpec(Parsing.Nonterm):
"%nonterm"
def reduceStructSpec(self, struct, structdecls):
"%reduce struct StructDecls"
self.data = structured_sort_specification(structdecls.data)
printVerbose("StructSpec", self.data)
# StructDecls ::= StructDecl |
# StructDecl StructDecls
class StructDecls(Parsing.Nonterm):
"%nonterm"
def reduceStructDecl(self, structdecl):
"%reduce StructDecl"
self.data = structured_sort_declaration_list([structdecl.data])
printVerbose("StructDecls", self.data)
def reduceStructDecls(self, structdecls, mid, structdecl):
"%reduce StructDecls mid StructDecl"
self.data = structdecls.data
self.data.push_back(structdecl.data)
printVerbose("StructDecls", self.data)
# StructDecl ::= ID Label |
# ID Label ":" Domain
class StructDecl(Parsing.Nonterm):
"%nonterm"
def reduceStructNoDomain(self, id, label):
"%reduce id Label"
self.data = structured_sort_declaration(id.data, label.data)
printVerbose("StructDecl", self.data)
def reduceStructDecl(self, id, label, colon, labelleddomain):
"%reduce id Label colon LabelledDomain"
self.data = structured_sort_declaration(id.data, label.data, labelleddomain.data)
printVerbose("StructDecl", self.data)
# VarDecls ::= VarDecl
# | VarDecls VarDecl
class VarDecls(Parsing.Nonterm):
"%nonterm"
def reduceVarDecl(self, vardecl, semicolon):
"%reduce VarDecl semicolon"
self.data = variable_declaration_list([vardecl.data])
printVerbose("VarDecls", self.data)
def reduceVarDecls(self, vardecls, vardecl, semicolon):
"%reduce VarDecls VarDecl semicolon"
self.data = vardecls.data
self.data.push_back(vardecl.data)
printVerbose("VarDecls", self.data)
# VarDecl ::= ID ":" SortExpr
class VarDecl(Parsing.Nonterm):
"%nonterm"
def reduceVarDecl(self, id, colon, sortexpr):
"%reduce id colon SortExpr"
self.data = variable_declaration(id.data, sortexpr.data)
printVerbose("VarDecl", self.data)
# OpDecls ::= OpDecl
# | OpDecls OpDecl
class OpDecls(Parsing.Nonterm):
"%nonterm"
def reduceOpDecl(self, opdecl, semicolon):
"%reduce OpDecl semicolon"
self.data = function_declaration_list([opdecl.data])
printVerbose("OpDecls", self.data)
def reduceOpDecls(self, opdecls, opdecl, semicolon):
"%reduce OpDecls OpDecl semicolon"
self.data = opdecls.data
self.data.push_back(opdecl.data)
printVerbose("OpDecls", self.data)
# OpDecl ::= ID Label ":" SortExpr
class OpDecl(Parsing.Nonterm):
"%nonterm"
def reduceOpDecl(self, id, label, colon, sortexpr):
"%reduce id Label colon SortExpr"
self.data = function_declaration(id.data, sortexpr.data, label.data)
printVerbose("OpDecl", self.data)
# Hack for count on lists
def reduceCount(self, hash, label, colon, sortexpr):
"%reduce hash Label colon SortExpr"
id = TokenID(parser, "#")
self.data = function_declaration(id.data, sortexpr.data, label.data)
printVerbose("OpDecl", self.data)
# EqnDecls ::= EqnDecl
# | EqnDecls EqnDecl
class EqnDecls(Parsing.Nonterm):
"%nonterm"
def reduceDataEqn(self, eqndecl, semicolon):
"%reduce EqnDecl semicolon"
self.data = equation_declaration_list([eqndecl.data])
printVerbose("EqnDecls", self.data)
def reduceDataEqns(self, eqndecls, eqndecl, semicolon):
"%reduce EqnDecls EqnDecl semicolon"
self.data = eqndecls.data
self.data.push_back(eqndecl.data)
printVerbose("EqnDecls", self.data)
# EqnDecl ::= DataExpr "=" DataExpr
class EqnDecl(Parsing.Nonterm):
"%nonterm"
def reduceDataEqn(self, lhs, equals, rhs):
"%reduce DataExpr equals DataExpr"
self.data = equation_declaration(lhs.data, rhs.data)
printVerbose("EqnDecl", self.data)
def reduceDataEqnCondition(self, condition, arrow, lhs, equals, rhs):
"%reduce DataExpr arrow DataExpr equals DataExpr"
self.data = equation_declaration(lhs.data, rhs.data, condition.data)
printVerbose("EqnDecl", self.data)
# DataExpr ::= DataExprPrimary
# | DataExpr "(" DataExprs ")"
# | lambda(VarDecl, DataExpr)
# | forall(VarDecls, DataExpr)
# | exists(VarDecls, DataExpr)
class DataExpr(Parsing.Nonterm):
"%nonterm"
def reduceDataExprPrimary(self, dataexprprimary):
"%reduce DataExprPrimary"
self.data = dataexprprimary.data
printVerbose("DataExpr", self.data)
def reduceApplication(self, head, lbrack, arguments, rbrack):
"%reduce DataExpr lbrack DataExprs rbrack"
self.data = data_application(head.data, arguments.data)
printVerbose("DataExpr", self.data)
def reduceLambda(self, lmb, lbrack, vardecl, comma, expr, rbrack):
"%reduce lambda lbrack VarDecl comma DataExpr rbrack"
self.data = lambda_abstraction(vardecl.data, expr.data)
printVerbose("DataExpr", self.data)
def reduceForall(self, binder, lbrack, vardecl, comma, expr, rbrack):
"%reduce forall lbrack VarDecl comma DataExpr rbrack"
self.data = forall(vardecl.data, expr.data)
printVerbose("DataExpr", self.data)
def reduceExists(self, exists, lbrack, vardecl, comma, expr, rbrack):
"%reduce exists lbrack VarDecl comma DataExpr rbrack"
self.data = exists(vardecl.data, expr.data)
printVerbose("DataExpr", self.data)
# DataExprPrimary ::= ID
# | "(" DataExpr ")"
class DataExprPrimary(Parsing.Nonterm):
"%nonterm"
def reduceID(self, id):
"%reduce id"
self.data = data_variable_or_function_symbol(id.data)
printVerbose("DataExprPrimary", self.data)
# Hack for allowing application of list count
def reduceCount(self, hash):
"%reduce hash"
id = TokenID(parser, "#")
self.data = function_symbol(id.data)
printVerbose("DataExprPrimary", self.data)
def reduceBracketedDataExpr(self, lbrack, dataexpr, rbrack):
"%reduce lbrack DataExpr rbrack"
self.data = dataexpr.data
printVerbose("DataExprPrimary", self.data)
# DataExprs ::= DataExpr
# | DataExprs "," DataExpr
class DataExprs(Parsing.Nonterm):
"%nonterm"
def reduceDataExpr(self, dataexpr):
"%reduce DataExpr"
self.data = data_expression_list([dataexpr.data])
printVerbose("DataExprs", self.data)
def reduceDataExprs(self, dataexprs, comma, dataexpr):
"%reduce DataExprs comma DataExpr"
self.data = dataexprs.data
self.data.push_back(dataexpr.data)
printVerbose("DataExprs", self.data)
# SortExpr ::= SortExprPrimary
# | LabelledDomain -> SortExpr
# | Domain -> SortExpr
# | ID "(" SortParam ")"
class SortExpr(Parsing.Nonterm):
"%nonterm"
def reduceSortExprPrimary(self, sortexpr):
"%reduce SortExprPrimary"
self.data = sortexpr.data
printVerbose("SortExpr", self.data)
def reduceSortExprArrowLabelled(self, domain, arrow, sortexpr):
"%reduce LabelledDomain arrow SortExpr"
self.data = sort_arrow(domain.data, sortexpr.data)
printVerbose("SortExpr", self.data)
def reduceSortExprArrow(self, domain, arrow, sortexpr):
"%reduce Domain arrow SortExpr"
self.data = sort_arrow(domain.data, sortexpr.data)
printVerbose("SortExpr", self.data)
# SortParam ::= ID
class SortParam(Parsing.Nonterm):
"%nonterm"
def reduceId(self, id):
"%reduce id"
self.data = sort_identifier(id.data)
printVerbose("SortParam", self.data)
# Domain ::= SortExprPrimary Label
# | Domain # SortExprPrimary Label
class Domain(Parsing.Nonterm):
"%nonterm"
def reduceSortExprPrimary(self, expr):
"%reduce SortExprPrimary"
self.data = domain(False, [expr.data])
printVerbose("Domain", self.data)
def reduceHashedDomain(self, Domain, hash, SortExprPrimary):
"%reduce Domain hash SortExprPrimary"
self.data = Domain.data
self.data.push_back(SortExprPrimary.data)
printVerbose("Domain", self.data)
# LabelledDomain ::= SortExprPrimary Label
# | LabelledDomain # SortExprPrimary Label
class LabelledDomain(Parsing.Nonterm):
"%nonterm"
def reduceSortExprPrimary(self, expr, label):
"%reduce SortExprPrimary Label"
self.data = domain(True, [(expr.data, label.data)])
printVerbose("LabelledDomain", self.data)
def reduceHashedLabelledDomain(self, Domain, hash, SortExprPrimary, label):
"%reduce LabelledDomain hash SortExprPrimary Label"
self.data = Domain.data
self.data.push_back((SortExprPrimary.data, label.data))
printVerbose("LabelledDomain", self.data)
# SortExprPrimary ::= ID
# | LPAR SortExpr RPAR
class SortExprPrimary(Parsing.Nonterm):
"%nonterm"
def reduceId(self, expr):
"%reduce id"
self.data = sort_identifier(expr.data)
printVerbose("SortExprPrimary", self.data)
def reduceParen(self, lbrack, SortExpr, rbrack):
"%reduce lbrack SortExpr rbrack"
self.data = SortExpr.data
printVerbose("SortExprPrimary", self.data)
def reduceSortExprParam(self, container, lbrack, param, rbrack):
"%reduce id lbrack SortParam rbrack"
self.data = sort_container(container.data, param.data)
printVerbose("SortExprPrimary", self.data)
# Label ::= LANG ID RANG
class Label(Parsing.Nonterm):
"%nonterm"
def reduce(self, lang, id, rang):
"%reduce lang id rang"
self.data = label(id.data)
printVerbose("Label", self.data)
# -------------------------------------------------------#
# parser
# -------------------------------------------------------#
# Parser subclasses the Lr parser driver. Since the grammar is unambiguous, we
# have no need of the Glr driver's extra functionality, though there is nothing
# preventing us from using it.
#
# If you are curious how much more work the GLR driver has to do, simply change
# the superclass from Parsing.Lr to Parsing.Glr, then, run this program with
# verbosity enabled.
class Parser(Parsing.Lr):
def __init__(self, spec):
Parsing.Lr.__init__(self, spec)
# Brain-dead scanner. The scanner does not have to be a method of this
# class, so for more complex parsers it is no problem to separate the
# scanner into a separate module.
def scan(self, input):
syms = {"->" : TokenArrow,
"|" : TokenMid,
"#include": TokenInclude,
"#using" : TokenUsing,
"#supertypeof" : TokenSupertypeOf,
"#" : TokenHash,
":" : TokenColon,
";" : TokenSemiColon,
"," : TokenComma,
"(" : TokenLBrack,
")" : TokenRBrack,
"<\"" : TokenLAng,
"\">" : TokenRAng,
"=" : TokenEquals,
"sort" : TokenSort,
"cons" : TokenCons,
"map" : TokenMap,
"var" : TokenVar,
"eqn" : TokenEqn,
"struct" : TokenStruct,
"lambda" : TokenLambda,
"forall" : TokenForall,
"exists" : TokenExists
}
# First make sure the needed separators are surrounded by spaces
# Some parts always need to get extra whitespace
input = re.sub('(->|[();,])', r" \1 ", input)
# needs to get whitespace if it is not followed by "include"
input = re.sub('(#)(?!(include|using|supertypeof))', r" \1 ", input)
# surround : with whitespace except if preceded by { (for {:})
input = re.sub(r'([^{])(\:)', r"\1 \2 ", input)
# < needs to get whitespace if it starts a label
input = re.sub('(<\")(?=\w)', r"\1 ", input)
# > needs to get whitespace if it ends a label
input = re.sub('(?<=\w)(\">)', r" \1", input)
# Split the input at whitespace, producing the tokens
p=re.compile(r'\s+')
if verbose:
print "split input: %s" % (p.split(input))
for word in p.split(input):
if word != '':
if word in syms:
token = syms[word](self)
else:
token = TokenID(parser, word)
# Feed token to parser.
self.token(token)
# Tell the parser that the end of input has been reached.
self.eoi()
#--------------------------------------------------------#
# read_text
#--------------------------------------------------------#
# returns the contents of the file 'filename' as a string
def read_text(filename):
try:
f = open(filename, 'r')
except IOError, e:
print 'Unable to open file ' + filename + ' ', e
sys.exit(0)
text = f.read()
f.close()
return text
#--------------------------------------------------------#
# read_paragraphs
#--------------------------------------------------------#
# returns the contents of the file 'filename' as a list of paragraphs
def read_paragraphs(file):
text = read_text(file)
paragraphs = re.split('\n\s*\n', text)
return paragraphs
#
# filter_comments
#
def filter_comments(filename):
paragraphs = read_paragraphs(filename)
clines = [] # comment lines
glines = [] # grammar lines
for paragraph in paragraphs:
lines = string.split(paragraph, '\n')
for line in lines:
if re.match('%.*', line):
clines.append(line)
else:
glines.append(line)
comment = string.join(clines, '\n')
spec = string.join(glines, '\n')
return spec
#
# get_includes
# Find the includes that are at the beginning of the input
#
def get_includes(input):
lines = string.split(input, '\n')
includes = []
for line in lines:
line = line.strip()
if re.match('#include.*', line):
includes.append(line.replace('#include ',''))
return includes
#-------------------------------------------------------#
# parse_spec
#-------------------------------------------------------#
# This parses the input file and removes comment lines from it
# Furthermore, we use context from files that are included, therefore these
# have to be parsed first.
def parse_spec(infilename):
global outputcode
global parser
global includes_table
global current_file
input = filter_comments(infilename)
includes = get_includes(input)
parser.reset()
# Now first process the includes:
for include in includes:
if not includes_table.has_key(include):
parse_spec(include)
current_file = infilename
parser.reset()
if input not in includes_table:
parser.scan(input)
# -------------------------------------------------------#
# main
# -------------------------------------------------------#
def main():
global context
global verbose
global debug
usage = "usage: %prog [options] infile outfile"
option_parser = OptionParser(usage)
option_parser.add_option("-v", "--verbose", action="store_true", help="give verbose output")
option_parser.add_option("-d", "--debug", action="store_true", help="give debug output")
(options, args) = option_parser.parse_args()
if options.verbose:
verbose = True
if options.debug:
verbose = True
debug = True
parser.verbose = True
if len(args) > 0:
infilename = args[0]
outfilename = args[1]
try:
infile = open(infilename)
outfile = open(outfilename, "w")
except IOError, e:
print "Unable to open file ", filename, " ", e
return
# Parse specification in infilename and write the code to outfile
parse_spec(infilename)
outputcode = context.code()
outfile.write(outputcode)
else:
option_parser.print_help()
# -------------------------------------------------------#
# global parser stuff, needs to be here
# -------------------------------------------------------#
# Introspect this module to generate a parser. Enable all the bells and
# whistles.
spec = Parsing.Spec(sys.modules[__name__],
pickleFile="codegen.pickle",
skinny=False,
logFile="codegen.log",
graphFile="codegen.dot",
verbose=True)
# Create a parser that uses the parser tables encapsulated by spec. In this
# program, we are only creating one parser instance, but it is possible for
# multiple parsers to use the same Spec simultaneously.
parser = Parser(spec)
#
# Global variables to collect needed information during parsing.
#
verbose = False # Switch on debug output?
debug = False # Switch on verbose output?
includes_table = {} # Maps sorts to include files
if __name__ == "__main__":
main()
|