/opt/ros/diamondback/stacks/ethzasl_aseba/asebaros/aseba/svn/compiler/tree-build.cpp

Go to the documentation of this file.

/*
        Aseba - an event-based framework for distributed robot control
        Copyright (C) 2007--2009:
                Stephane Magnenat <stephane at magnenat dot net>
                (http://stephane.magnenat.net)
                and other contributors, see authors.txt for details
                Mobots group, Laboratory of Robotics Systems, EPFL, Lausanne
        
        This program is free software: you can redistribute it and/or modify
        it under the terms of the GNU General Public License as published by
        the Free Software Foundation, either version 3 of the License, or
        any other version as decided by the two original authors
        Stephane Magnenat and Valentin Longchamp.
        
        This program is distributed in the hope that it will be useful,
        but WITHOUT ANY WARRANTY; without even the implied warranty of
        MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
        GNU General Public License for more details.
        
        You should have received a copy of the GNU General Public License
        along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#include "tree.h"
#include <cstdlib>

// Asserts a dynamic cast.      Similar to the one in boost/cast.hpp
template<typename Derived, typename Base>
static inline Derived polymorphic_downcast(Base base)
{
        Derived derived = dynamic_cast<Derived>(base);
        if (!derived)
                abort();
        return derived;
}

namespace Aseba
{
        
        Node::~Node()
        {
                // we assume that if children is 0, another node has taken ownership of it
                for (size_t i = 0; i < children.size(); i++)
                        if (children[i])
                                delete children[i];
        }
        
        EventDeclNode::EventDeclNode(const SourcePos& sourcePos, unsigned eventId) :
                Node(sourcePos),
                eventId(eventId)
        {
        
        }
        
        SubDeclNode::SubDeclNode(const SourcePos& sourcePos, unsigned subroutineId) :
                Node(sourcePos),
                subroutineId(subroutineId)
        {
        
        }
        
        CallSubNode::CallSubNode(const SourcePos& sourcePos, unsigned subroutineId) :
                Node(sourcePos),
                subroutineId(subroutineId)
        {
        
        }
        
        BinaryArithmeticNode::BinaryArithmeticNode(const SourcePos& sourcePos, AsebaBinaryOperator op, Node *left, Node *right) :
                Node(sourcePos),
                op(op)
        {
                children.push_back(left);
                children.push_back(right);
        }
        
        BinaryArithmeticNode *BinaryArithmeticNode::fromComparison(const SourcePos& sourcePos, Compiler::Token::Type op, Node *left, Node *right)
        {
                return new BinaryArithmeticNode(
                        sourcePos,
                        static_cast<AsebaBinaryOperator>((op - Compiler::Token::TOKEN_OP_EQUAL) + ASEBA_OP_EQUAL),
                        left,
                        right
                );
        }
        
        BinaryArithmeticNode *BinaryArithmeticNode::fromShiftExpression(const SourcePos& sourcePos, Compiler::Token::Type op, Node *left, Node *right)
        {
                return new BinaryArithmeticNode(
                        sourcePos,
                        static_cast<AsebaBinaryOperator>((op - Compiler::Token::TOKEN_OP_SHIFT_LEFT) + ASEBA_OP_SHIFT_LEFT),
                        left,
                        right
                );
        }
        
        BinaryArithmeticNode *BinaryArithmeticNode::fromAddExpression(const SourcePos& sourcePos, Compiler::Token::Type op, Node *left, Node *right)
        {
                return new BinaryArithmeticNode(
                        sourcePos,
                        static_cast<AsebaBinaryOperator>((op - Compiler::Token::TOKEN_OP_ADD) + ASEBA_OP_ADD),
                        left,
                        right
                );
        }
        
        BinaryArithmeticNode *BinaryArithmeticNode::fromMultExpression(const SourcePos& sourcePos, Compiler::Token::Type op, Node *left, Node *right)
        {
                return new BinaryArithmeticNode(
                        sourcePos,
                        static_cast<AsebaBinaryOperator>((op - Compiler::Token::TOKEN_OP_MULT) + ASEBA_OP_MULT),
                        left,
                        right
                );
        }
        
        UnaryArithmeticNode::UnaryArithmeticNode(const SourcePos& sourcePos, AsebaUnaryOperator op, Node *child) :
                Node(sourcePos),
                op(op)
        {
                children.push_back(child);
        }
        
        ArrayReadNode::ArrayReadNode(const SourcePos& sourcePos, unsigned arrayAddr, unsigned arraySize, const std::string &arrayName) :
                Node(sourcePos),
                arrayAddr(arrayAddr),
                arraySize(arraySize),
                arrayName(arrayName)
        {
        
        }
        
        ArrayWriteNode::ArrayWriteNode(const SourcePos& sourcePos, unsigned arrayAddr, unsigned arraySize, const std::string &arrayName) :
                Node(sourcePos),
                arrayAddr(arrayAddr),
                arraySize(arraySize),
                arrayName(arrayName)
        {
        
        }
        
        CallNode::CallNode(const SourcePos& sourcePos, unsigned funcId) :
                Node(sourcePos),
                funcId(funcId)
        {
        
        }
        
}; // Aseba

---

asebaros
Author(s): $author
autogenerated on Mon Sep 5 08:41:53 2011