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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
/* File crlf.c
* June 20, 2006
* By Jessica Mink, Harvard-Smithsonian Center for Astrophysics
* Send bug reports to jmink@cfa.harvard.edu
Copyright (C) 2006
Smithsonian Astrophysical Observatory, Cambridge, MA USA
This program 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 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 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
static int verbose = 0; /* verbose/debugging flag */
static void usage();
static void HTMLFix();
int StripHTMLTags();
static char *RevMsg = "HTMLSP WCSTools 3.9.7, 26 April 2022, Jessica Mink (jmink@cfa.harvard.edu)";
int
main (ac, av)
int ac;
char **av;
{
char *fn;
char *str;
/* crack arguments */
for (av++; --ac > 0 && *(str = *av) == '-'; av++) {
char c;
while ((c = *++str))
switch (c) {
case 'v': /* more verbosity */
verbose++;
break;
default:
usage();
break;
}
}
/* There are ac remaining file names starting at av[0] */
if (ac == 0)
usage ();
while (ac-- > 0) {
fn = *av++;
if (verbose)
printf ("%s:\n", fn);
HTMLFix (fn);
if (verbose)
printf ("\n");
}
return (0);
}
static void
usage ()
{
fprintf (stderr,"HTMLSP: Remove HTML tags from input file\n");
fprintf(stderr,"Usage: htmlsp [-v] file1 file2 ... filen\n");
fprintf(stderr," -v: verbose\n");
exit (1);
}
static int flag; /* 0: searching for < or &,
1: searching for >,
2: searching for ; after &,
3: searching for </script>,</style>, --> */
static int k=0;
static char tempbuf[1024] = "";
static void
HTMLFix (name)
char *name;
{
char buffer[1000];
int fd;
int nbr, nnbr, i;
flag = 0;
fd = open (name, O_RDONLY);
nbr = 1000;
while (nbr > 0) {
nbr = read (fd, buffer, 1000);
if (nbr > 0) {
nnbr = StripHTMLTags (buffer, nbr);
(void) write (1, buffer, nnbr);
}
}
return;
}
int
StripHTMLTags (instring, size)
char *instring;
int size;
{
int i=0, j=0;
char searchbuf[1024] = "";
while (i < size) {
if (flag == 0) {
if (instring[i] == '<') {
flag = 1;
tempbuf[0] = '\0';
k=0; /* track for <script>,<style>, <!-- --> etc */
}
else if (instring[i] == '&') {
flag = 2;
}
else {
instring[j] = instring[i];
j++;
}
}
else if (flag == 1) {
tempbuf[k] = instring[i];
k++;
tempbuf[k] = '\0';
if ((0 == strcmp(tempbuf,"script"))) {
flag = 3;
strcpy (searchbuf,"</script>");
tempbuf[0] = '\0';
k = 0;
}
else if ((0 == strcmp(tempbuf,"style"))) {
flag = 3;
strcpy (searchbuf,"</style>");
tempbuf[0] = '\0';
k = 0;
}
else if ((0 == strcmp(tempbuf,"!--"))) {
flag = 3;
strcpy (searchbuf,"-->");
tempbuf[0] = '\0';
k = 0;
}
if (instring[i] == '>') {
if ((0 == strcmp (tempbuf, "/tr"))) {
fprintf (stderr, "encountered end of table line\n");
instring[j] = (char) 10;
}
else if ((0 == strcmp (tempbuf, "br"))) {
instring[j] = (char) 10;
}
else if ((0 == strcmp (tempbuf, "p"))) {
instring[j] = (char) 10;
}
else {
instring[j] = ' ';
}
j++;
flag = 0;
}
}
else if (flag == 2) {
if(instring[i] == ';') {
instring[j] = ' ';
j++;
flag = 0;
}
}
else if(flag == 3) {
tempbuf[k] = instring[i];
k++;
tempbuf[k] = '\0';
if (0 == strcmp(&tempbuf[0] + k - strlen(searchbuf),searchbuf)) {
flag = 0;
searchbuf[0] = '\0';
tempbuf[0] = '\0';
k = 0;
}
}
i++;
}
instring[j] = '\0';
return j;
}
/* Nov 5 2018 New program based on CRLF
*/
|
