/*************************************************************************** * This file is part of KDevelop * * Copyright 2007 Andreas Pakulat * * * * This program is free software; you can redistribute it and/or modify * * it under the terms of the GNU Library General Public License as * * published by the Free Software Foundation; either version 2 of the * * License, or (at your option) any later version. * * * * 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 Library General Public * * License along with this program; if not, write to the * * Free Software Foundation, Inc., * * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * ***************************************************************************/ #include "astvisitor.h" /** * Note: This has been generated using utilities/generate.py * but you can modifiy it, it's not regenerated automatically */ namespace Python { AstVisitor::AstVisitor() { } AstVisitor::~AstVisitor() { } void AstVisitor::visitNode(Ast* node) { if ( ! node ) return; switch ( node->astType ) { case Ast::CodeAstType: this->visitCode(dynamic_cast(node)); break; case Ast::FunctionDefinitionAstType: this->visitFunctionDefinition(dynamic_cast(node)); break; case Ast::ClassDefinitionAstType: this->visitClassDefinition(dynamic_cast(node)); break; case Ast::ReturnAstType: this->visitReturn(dynamic_cast(node)); break; case Ast::DeleteAstType: this->visitDelete(dynamic_cast(node)); break; case Ast::AssignmentAstType: this->visitAssignment(dynamic_cast(node)); break; case Ast::AugmentedAssignmentAstType: this->visitAugmentedAssignment(dynamic_cast(node)); break; case Ast::ForAstType: this->visitFor(dynamic_cast(node)); break; case Ast::WhileAstType: this->visitWhile(dynamic_cast(node)); break; case Ast::IfAstType: this->visitIf(dynamic_cast(node)); break; case Ast::WithAstType: this->visitWith(dynamic_cast(node)); break; case Ast::RaiseAstType: this->visitRaise(dynamic_cast(node)); break; case Ast::TryExceptAstType: this->visitTryExcept(dynamic_cast(node)); break; case Ast::TryFinallyAstType: this->visitTryFinally(dynamic_cast(node)); break; case Ast::AssertionAstType: this->visitAssertion(dynamic_cast(node)); break; case Ast::ImportAstType: this->visitImport(dynamic_cast(node)); break; case Ast::ImportFromAstType: this->visitImportFrom(dynamic_cast(node)); break; case Ast::ExecAstType: this->visitExec(dynamic_cast(node)); break; case Ast::GlobalAstType: this->visitGlobal(dynamic_cast(node)); break; case Ast::BreakAstType: this->visitBreak(dynamic_cast(node)); break; case Ast::ContinueAstType: this->visitContinue(dynamic_cast(node)); break; case Ast::PrintAstType: this->visitPrint(dynamic_cast(node)); break; case Ast::PassAstType: this->visitPass(dynamic_cast(node)); break; case Ast::BooleanOperationAstType: this->visitBooleanOperation(dynamic_cast(node)); break; case Ast::BinaryOperationAstType: this->visitBinaryOperation(dynamic_cast(node)); break; case Ast::UnaryOperationAstType: this->visitUnaryOperation(dynamic_cast(node)); break; case Ast::LambdaAstType: this->visitLambda(dynamic_cast(node)); break; case Ast::IfExpressionAstType: this->visitIfExpression(dynamic_cast(node)); break; case Ast::DictAstType: this->visitDict(dynamic_cast(node)); break; case Ast::SetAstType: this->visitSet(dynamic_cast(node)); break; case Ast::ListComprehensionAstType: this->visitListComprehension(dynamic_cast(node)); break; case Ast::SetComprehensionAstType: this->visitSetComprehension(dynamic_cast(node)); break; case Ast::DictionaryComprehensionAstType: this->visitDictionaryComprehension(dynamic_cast(node)); break; case Ast::GeneratorExpressionAstType: this->visitGeneratorExpression(dynamic_cast(node)); break; case Ast::CompareAstType: this->visitCompare(dynamic_cast(node)); break; case Ast::ReprAstType: this->visitRepr(dynamic_cast(node)); break; case Ast::NumberAstType: this->visitNumber(dynamic_cast(node)); break; case Ast::StringAstType: this->visitString(dynamic_cast(node)); break; case Ast::YieldAstType: this->visitYield(dynamic_cast(node)); break; case Ast::NameAstType: this->visitName(dynamic_cast(node)); break; case Ast::CallAstType: this->visitCall(dynamic_cast(node)); break; case Ast::AttributeAstType: this->visitAttribute(dynamic_cast(node)); break; case Ast::SubscriptAstType: this->visitSubscript(dynamic_cast(node)); break; case Ast::ListAstType: this->visitList(dynamic_cast(node)); break; case Ast::TupleAstType: this->visitTuple(dynamic_cast(node)); break; case Ast::EllipsisAstType: this->visitEllipsis(dynamic_cast(node)); break; case Ast::SliceAstType: this->visitSlice(dynamic_cast(node)); break; case Ast::ExtendedSliceAstType: this->visitExtendedSlice(dynamic_cast(node)); break; case Ast::IndexAstType: this->visitIndex(dynamic_cast(node)); break; case Ast::ArgumentsAstType: this->visitArguments(dynamic_cast(node)); break; case Ast::KeywordAstType: this->visitKeyword(dynamic_cast(node)); break; case Ast::ComprehensionAstType: this->visitComprehension(dynamic_cast(node)); break; case Ast::ExceptionHandlerAstType: this->visitExceptionHandler(dynamic_cast(node)); break; case Ast::AliasAstType: this->visitAlias(dynamic_cast(node)); break; case Ast::ExpressionAstType: break; case Ast::StatementAstType: break; } } }