blob: ddcbddc35caf9d444a48ac95c45534f9089bac70 (
plain)
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
|
/***************************************************************************
* Copyright (C) 2005 by Alexander Dymo *
* adymo@kdevelop.org *
* *
* Copyright (c) 2005 by Matt Rogers *
* mattr@kde.org *
* *
* 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 "autotoolsast.h"
namespace AutoTools {
//AST
AST::~AST()
{
for (TQValueList<AST*>::iterator it = m_children.begin(); it != m_children.end(); ++it)
{
AST *node = *it;
delete node;
}
}
void AST::addChildAST(AST *node)
{
m_children.append(node);
}
void AST::writeBack(TQString &buffer)
{
for (TQValueList<AST*>::const_iterator it = m_children.constBegin();
it != m_children.constEnd(); ++it)
{
if (*it)
(*it)->writeBack(buffer);
}
}
TQString AST::indentation()
{
TQString result;
for (int i = 0; i < depth(); i++)
result += '\t';
return result;
}
bool AST::hasChildren() const
{
return !m_children.isEmpty();
}
TQValueList<AST*> AST::children() const
{
return m_children;
}
//ProjectAST
void ProjectAST::writeBack(TQString &buffer)
{
if ( isRule() )
buffer += scopedID;
else
buffer += indentation();
AST::writeBack(buffer);
}
void ProjectAST::addChildAST(AST *node)
{
statements.append(node);
AST::addChildAST(node);
}
void AssignmentAST::writeBack(TQString &buffer)
{
buffer += indentation() + scopedID + " " + op + values.join("");
}
void AutomakeTargetAST::writeBack( TQString& buffer )
{
buffer += target + ":" + deps.join("");
}
void ConditionAST::writeBack( TQString& buffer )
{
buffer += indentation() + type + " " + conditionName;
}
void NewLineAST::writeBack(TQString &buffer)
{
buffer += "\n";
}
void CommentAST::writeBack(TQString &buffer)
{
buffer += indentation() + comment;
}
}
// kate: indent-mode csands; tab-width 4; space-indent off;
|
