blob: 504303b5589e18189a5ba0f5372602ad3cb3192b (
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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
/***************************************************************************
* Copyright (C) 2005 by Alexander Dymo *
* [email protected] *
* *
* 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 "qmakeast.h"
#include <kdebug.h>
namespace TQMake {
//AST
AST::~AST()
{
for (TQValueList<AST*>::iterator it = m_children.begin(); it != m_children.end(); ++it)
{
AST *node = *it;
delete node;
}
m_children.clear();
}
void AST::addChildAST(AST *node)
{
m_children.append(node);
}
void AST::removeChildAST(AST *node)
{
m_children.remove(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 += " ";
return result;
}
//ProjectAST
void ProjectAST::writeBack(TQString &buffer)
{
bool hasActualStatements = false;
for (TQValueList<TQMake::AST*>::const_iterator it = m_children.begin(); it != m_children.end(); ++it)
{
if ((*it)->nodeType() != AST::IncludeAST)
{
hasActualStatements = true;
break;
}
}
if (isScope())
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += scopedID;
if( m_children.count() == 1 )
buffer += " : ";
else
buffer += " {";
}
else if (isFunctionScope())
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += scopedID + "(" + args + ")";
if( m_children.count() == 1 && hasActualStatements )
buffer += ": ";
else if( (m_children.count() > 0 && hasActualStatements) )
buffer += "{";
else
buffer += "";
}
else if( !buffer.endsWith(": ") )
buffer += indentation();
AST::writeBack(buffer);
if (isScope() && m_children.count() > 1 )
buffer += indentation() + "}";
if (isFunctionScope() && (hasActualStatements) && m_children.count() > 1)
buffer += indentation() + "}";
}
void ProjectAST::setLineEnding( ProjectAST::LineEnding l )
{
m_lineEnding = l;
}
ProjectAST::LineEnding ProjectAST::lineEnding()
{
return m_lineEnding;
}
//AssignmentAST
AssignmentAST::~AssignmentAST()
{
}
void AssignmentAST::writeBack(TQString &buffer)
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += scopedID + " " + op;
if( values.first().stripWhiteSpace() != "" )
buffer += " ";
buffer += values.join("");
}
//NewLineAST
void NewLineAST::writeBack(TQString &buffer)
{
buffer += "\n";
}
//CommentAST
void CommentAST::writeBack(TQString &buffer)
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += comment;
}
//IncludeAST
void IncludeAST::writeBack(TQString &/*buffer*/)
{
}
}
// kate: space-indent on; indent-width 4; tab-width 4; replace-tabs on
|
