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
|
------------------------------------------------------------------------------
-- Templates Parser --
-- --
-- Copyright (C) 1999 - 2005 --
-- AdaCore --
-- --
-- This library 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 2 of the License, or (at --
-- your option) any later version. --
-- --
-- This library 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 library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO;
separate (Templates_Parser)
package body Data is
-----------
-- Parse --
-----------
function Parse (Line : in String) return Tree is
Begin_Tag : constant String
:= To_String (Templates_Parser.Begin_Tag);
End_Tag : constant String
:= To_String (Templates_Parser.End_Tag);
function Build (Line : in String) return Tree;
-- Recursive function to build the tree
-----------
-- Build --
-----------
function Build (Line : in String) return Tree is
Start, Stop : Natural;
begin
if Line = "" then
return null;
else
Start := Strings.Fixed.Index (Line, Begin_Tag);
if Start = 0 then
-- No more tag
return new Node'(Text,
null,
To_Unbounded_String (Line));
else
Stop := Strings.Fixed.Index (Line, End_Tag);
if Stop = 0 then
Exceptions.Raise_Exception
(Internal_Error'Identity,
"Tag variable not terminated (missing " & End_Tag & ")");
else
Stop := Stop + End_Tag'Length - 1;
if Start = Line'First then
-- The first token in Line is a variable
return new Node'
(Var,
Build (Line (Stop + 1 .. Line'Last)),
Build (Line (Start .. Stop)));
else
-- We have some text before the tag
return new Node'
(Text,
Build (Line (Start .. Line'Last)),
To_Unbounded_String (Line (Line'First .. Start - 1)));
end if;
end if;
end if;
end if;
end Build;
begin
return Build (Line);
end Parse;
----------------
-- Print_Tree --
----------------
procedure Print_Tree (D : in Tree) is
N : Tree := D;
NL : Boolean := False;
begin
while N /= null loop
case N.Kind is
when Text =>
declare
Value : constant String := To_String (N.Value);
begin
Text_IO.Put (Value);
if Value'Length > 0 then
NL := Value (Value'Last) = ASCII.LF;
else
NL := False;
end if;
end;
when Var =>
Text_IO.Put (Image (N.Var));
NL := False;
end case;
N := N.Next;
end loop;
if not NL then
Text_IO.New_Line;
end if;
end Print_Tree;
-------------
-- Release --
-------------
procedure Release (D : in out Tree) is
procedure Free is new Ada.Unchecked_Deallocation (Node, Tree);
P : Tree;
T : Tree := D;
begin
while T /= null loop
P := T;
T := T.Next;
if P.Kind = Var then
Release (P.Var);
end if;
Free (P);
end loop;
D := null;
end Release;
end Data;
|
