forked from jpaciello/compiladores
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtraductor.c
237 lines (215 loc) · 5.03 KB
/
traductor.c
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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include "parser.c"
#define CANT_COMP_LEX 10
FILE *file_output;
void json_trad();
void element_trad();
void array_1_trad();
void array_2_trad();
void element_list_1_trad();
void element_list_2_trad();
void object_1_trad();
void object_2_trad();
void attribute_trad();
void attributes_list_1_trad();
void attributes_list_2_trad();
void attribute_name_trad();
void attribute_value_trad();
void match(int);
void string_sin_comillas(char* cadena);
int tabulacion=0;
void print_tab();
void string_sin_comillas(char* cadena){
char string[TAMLEX];
strcpy(string,cadena);
int i=1;
while(string[i] != '"'){
printf("%c",string[i]);
fprintf(file_output,"%c",string[i]);
i++;
}
}
void print_tab(){
int i=0;
for (i=1;i<=tabulacion;i++){
printf(" ");
fprintf(file_output," ");
}
}
void json_trad(){
element_trad();
}
void element_trad(){
if(t.compLex == L_LLAVE){
object_1_trad();
}
else if(t.compLex == L_CORCHETE){
array_1_trad();
}
}
void array_1_trad(){
if(t.compLex == L_CORCHETE){
match(L_CORCHETE);
array_2_trad();
print_tab();
}
}
void array_2_trad(){
if(t.compLex == L_CORCHETE || t.compLex == L_LLAVE){
printf("\n");
fprintf(file_output,"\n");
print_tab();
printf("<item>\n");
fprintf(file_output,"<item>\n");
tabulacion+=4;
element_list_1_trad();
match(R_CORCHETE);
print_tab();
printf("</item>\n");
fprintf(file_output,"</item>\n");
tabulacion-=4;
}
else if(t.compLex == R_CORCHETE){
tabulacion-=4;
match(R_CORCHETE);
}
}
void element_list_1_trad(){
if(t.compLex == L_CORCHETE || t.compLex == L_LLAVE){
element_trad();
element_list_2_trad();
}
}
void element_list_2_trad(){
if(t.compLex == R_CORCHETE){
return;
}
if(t.compLex == COMA){
match(COMA);
print_tab();
printf("</item>\n");
fprintf(file_output,"</item>\n");
print_tab();
printf("<item>\n");
fprintf(file_output,"<item>\n");
tabulacion+=4;
element_trad();
element_list_2_trad();
}
}
void object_1_trad(){
if(t.compLex == L_LLAVE){
match(L_LLAVE);
object_2_trad();
}
}
void object_2_trad(){
if(t.compLex == LITERAL_CADENA){
attributes_list_1_trad();
match(R_LLAVE);
}
else if(t.compLex == R_LLAVE){
match(R_LLAVE);
}
}
void attributes_list_1_trad(){
if(t.compLex == LITERAL_CADENA){
attribute_trad();
attributes_list_2_trad();
}
}
void attributes_list_2_trad(){
if (t.compLex == R_LLAVE){
tabulacion-=4;
return;
}
if(t.compLex == COMA){
match(COMA);
attribute_trad();
attributes_list_2_trad();
}
}
void attribute_trad(){
if(t.compLex == LITERAL_CADENA){
print_tab();
char lexema[TAMLEX];
strcpy(lexema,t.lexema);
printf("<");
fprintf(file_output,"<");
attribute_name_trad();
printf(">");
fprintf(file_output,">");
match(DOS_PUNTOS);
attribute_value_trad();
printf("</");
fprintf(file_output,"</");
string_sin_comillas(lexema);
printf(">\n");
fprintf(file_output,">\n");
}
}
void attribute_name_trad(){
if(t.compLex == LITERAL_CADENA){
string_sin_comillas(t.lexema);
match(LITERAL_CADENA);
}
}
void attribute_value_trad(){
if(t.compLex == L_CORCHETE || t.compLex == L_LLAVE){
tabulacion +=4;
element_trad();
}
else if(t.compLex == LITERAL_CADENA){
string_sin_comillas(t.lexema);
match(LITERAL_CADENA);
}
else if(t.compLex == LITERAL_NUM){
printf("%s",t.lexema);
fprintf(file_output,"%s",t.lexema);
match(LITERAL_NUM);
}
else if(t.compLex == PR_TRUE){
printf("%s",t.lexema);
fprintf(file_output,"%s",t.lexema);
match(PR_TRUE);
}
else if(t.compLex == PR_FALSE){
printf("%s",t.lexema);
fprintf(file_output,"%s",t.lexema);
match(PR_FALSE);
}
else if(t.compLex == PR_NULL){
printf("%s",t.lexema);
fprintf(file_output,"%s",t.lexema);
match(PR_NULL);
}
}
int main (int argc,char* args[]){
if(argc > 1){
if (!(archivo=fopen(args[1],"rt"))){
printf("El archivo no existe\n");
exit(1);
}
sigLex();
json();
file_output=fopen("output.xml","a");
if(accept){
fclose(archivo);
archivo=fopen(args[1],"rt");
sigLex();
json_trad();
}
else {
fprintf(file_output,"\n Error sintáctico");
}
fclose(file_output);
}
else{
printf("ERROR: Se debe proveer la ruta al archivo fuente.\n");
exit(1);
}
return 0;
}