2278363015
This is simply a translation of the C++ slicc into python with very minimal reorganization of the code. The output can be verified as nearly identical by doing a "diff -wBur". Slicc can easily be run manually by using util/slicc
90 lines
3.7 KiB
Python
90 lines
3.7 KiB
Python
# Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
# Copyright (c) 2009 The Hewlett-Packard Development Company
|
|
# All rights reserved.
|
|
#
|
|
# Redistribution and use in source and binary forms, with or without
|
|
# modification, are permitted provided that the following conditions are
|
|
# met: redistributions of source code must retain the above copyright
|
|
# notice, this list of conditions and the following disclaimer;
|
|
# redistributions in binary form must reproduce the above copyright
|
|
# notice, this list of conditions and the following disclaimer in the
|
|
# documentation and/or other materials provided with the distribution;
|
|
# neither the name of the copyright holders nor the names of its
|
|
# contributors may be used to endorse or promote products derived from
|
|
# this software without specific prior written permission.
|
|
#
|
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
from m5.util import code_formatter
|
|
|
|
from slicc.ast.ExprAST import ExprAST
|
|
from slicc.symbols import Type
|
|
|
|
class InfixOperatorExprAST(ExprAST):
|
|
def __init__(self, slicc, left, op, right):
|
|
super(InfixOperatorExprAST, self).__init__(slicc)
|
|
|
|
self.left = left
|
|
self.op = op
|
|
self.right = right
|
|
|
|
def __repr__(self):
|
|
return "[InfixExpr: %r %s %r]" % (self.left, self.op, self.right)
|
|
|
|
def generate(self, code):
|
|
lcode = code_formatter()
|
|
rcode = code_formatter()
|
|
|
|
ltype = self.left.generate(lcode)
|
|
rtype = self.right.generate(rcode)
|
|
|
|
# Figure out what the input and output types should be
|
|
if self.op in ("==", "!="):
|
|
output = "bool"
|
|
if (ltype != rtype):
|
|
self.error("Type mismatch: left and right operands of " +
|
|
"operator '%s' must be the same type. " +
|
|
"left: '%s', right: '%s'",
|
|
self.op, ltype, rtype)
|
|
else:
|
|
if self.op in ("&&", "||"):
|
|
# boolean inputs and output
|
|
inputs = "bool"
|
|
output = "bool"
|
|
elif self.op in ("==", "!=", ">=", "<=", ">", "<"):
|
|
# Integer inputs, boolean output
|
|
inputs = "int"
|
|
output = "bool"
|
|
else:
|
|
# integer inputs and output
|
|
inputs = "int"
|
|
output = "int"
|
|
|
|
inputs_type = self.symtab.find(inputs, Type)
|
|
|
|
if inputs_type != ltype:
|
|
self.left.error("Type mismatch: left operand of operator " +
|
|
"'%s' expects type '%s', actual was '%s'",
|
|
self.op, inputs, ltype)
|
|
|
|
if inputs_type != rtype:
|
|
self.right.error("Type mismatch: right operand of operator " +
|
|
"'%s' expects type '%s', actual was '%s'",
|
|
self.op, inputs, rtype)
|
|
|
|
# All is well
|
|
fix = code.nofix()
|
|
code("($lcode ${{self.op}} $rcode)")
|
|
code.fix(fix)
|
|
return self.symtab.find(output, Type)
|