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
|
/* $Id$
*
* Copyright (C) 2007-2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#ifndef __CASE_ALTERNATIVE_HPP_INCLUDED
#define __CASE_ALTERNATIVE_HPP_INCLUDED
#include "frontend/ast/AstNode.hpp"
#include "frontend/ast/SeqStat.hpp"
#include "frontend/ast/Expression.hpp"
namespace ast {
/** one alternative for a case statement */
class CaseAlternative : public AstNode {
public:
//! c'tor
/** @param choices List of expressions for this alternative.
* @param thenList List of statements to do if choices is true.
* @param loc location of the alternative.
*/
CaseAlternative(
std::list<Expression*>* choices,
std::list<SeqStat*>* thenList,
Location loc
) : AstNode(loc),
isVals(choices),
thenStats(thenList) {}
//! Accept a Visitor.
/** All leaf AST nodes need to implement this method.
*
* @param visitor the Visitor that can visit this node.
*/
virtual void accept(Visitor& visitor) {
visitor.visit(*this);
}
/** Put a textual representation of the AstNode on the stream.
* @param stream stream to put the textual representation to.
*/
virtual void put(std::ostream &stream) const {
util::MiscUtil::listPut(this->isVals, stream, "| ");
stream << " => ";
util::MiscUtil::listPut(this->thenStats, stream, "; ");
}
/** evaluate this alternative, if the condition of the
* case-statement is one of isVals
*/
std::list<Expression*>* isVals;
/** sequential statements of this alternative */
std::list<SeqStat*>* thenStats;
protected:
/** Destructor */
virtual ~CaseAlternative() {
util::MiscUtil::lterminate(isVals);
util::MiscUtil::lterminate(thenStats);
}
};
};
#endif /* __CASE_ALTERNATIVE_HPP_INCLUDED */
|
