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
|
/* $Id: parser.c,v 1.7 2001/11/10 15:40:19 riq Exp $ */
/* Tenes Empanadas Graciela
*
* Copyright (C) 2000 Ricardo Quesada
*
* Author: Ricardo Calixto Quesada <rquesada@core-sdi.com>
*
* 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; only version 2 of the License.
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
*/
/*
* IN: PPARSER (->data tiene la cadena a parsear )
* OUT: PPARSER->data = Puntero a la data
* PPARSER->token = 1er token
* PPARSER->valor = su valor
* PPARSER->hay_otro = si hay mas datos para leer
*
* Separadores: son pasados por PDELIM igualador
* Igualadores: son pasados por PDELIM separador
* Fin: asciiz o \n o \r
* Ejemplos validos:
* "Quiero un nuevo mundo=TRUE;Me gusta Linux=Si"
* "Hola;Como;Te;Va"
* Ejemplos no validos:
* "Hola=343=534"
*/
#include <ctype.h>
#include <stdio.h>
#include "all.h"
DELIM delim_null={ '\0', '\0', '\0' };
/* Que tipo de char es? */
static PARSER_VALUE que_es( char a, PDELIM igualador, PDELIM separador )
{
if( a==0 || a=='\n' || a=='\r' )
return PARSER_FIN;
if( a==igualador->a || a==igualador->b || a==igualador->c )
return PARSER_IGUAL;
if( a==separador->a || a==separador->b || a==separador->c )
return PARSER_SEPARADOR;
return PARSER_DATA;
}
static PARSER_VALUE
analiza( int *pos, /* En que pos corto la cadena */
char *in, /* Cadena de entrada */
char *out, /* Cadena de salida */
PDELIM igualador, /* Igualadores */
PDELIM separador, /* Separadores */
int maxlen
)
{
PARSER_VALUE pval=PARSER_DATA;
int i,j;
int quote=0;
out[0]=0;
/* copia data */
for(i=0,j=0;i<maxlen;i++) {
if( in[i] == '"' ) {
quote = ! quote;
continue;
}
if( ! quote ) {
if( (pval=que_es(in[i],igualador,separador)) != PARSER_DATA )
break;
}
/* out[i]=tolower(in[i]); */
out[j++]=in[i];
out[j]=0;
}
/* se termino de copiar en la pos i */
if(i==PARSER_TOKEN_MAX) {
return PARSER_ERROR;
}
*pos=i;
return pval;
}
/* Unica funcion exportable */
int parser_call( PPARSER p_in )
{
PARSER_VALUE pval;
int i;
if( (pval=analiza( &i, p_in->data, p_in->token, p_in->igualador, p_in->separador,PARSER_TOKEN_MAX )) == PARSER_ERROR )
return FALSE;
p_in->value[0]=0;
switch(pval) {
case PARSER_FIN:
p_in->data=NULL;
p_in->hay_otro=FALSE;
return TRUE;
case PARSER_SEPARADOR:
p_in->data=&p_in->data[i+1];
p_in->hay_otro=TRUE;
return TRUE;
case PARSER_IGUAL:
{
int j;
// pval = analiza( &j, &p_in->data[i+1], p_in->value, p_in->igualador, p_in->separador, PARSER_VALUE_MAX );
pval = analiza( &j, &p_in->data[i+1], p_in->value, &delim_null, p_in->separador, PARSER_VALUE_MAX );
if( pval==PARSER_IGUAL || pval==PARSER_ERROR )
return FALSE;
if( pval==PARSER_SEPARADOR ) {
p_in->data = &p_in->data[j+1 + i+1];
p_in->hay_otro=TRUE;
} else { /* PARSER_FIN */
p_in->data = NULL;
p_in->hay_otro=FALSE;
}
return TRUE;
}
default:
return FALSE;
}
}
|
