diff --git a/Documentation/Projet_Syst_Info_2021.pdf b/Documentation/Projet_Syst_Info_2021.pdf
new file mode 100644
index 0000000..ca8854c
Binary files /dev/null and b/Documentation/Projet_Syst_Info_2021.pdf differ
diff --git a/Documentation/grammaire_c_minimaliste b/Documentation/grammaire_c_minimaliste
new file mode 100644
index 0000000..32f0faa
--- /dev/null
+++ b/Documentation/grammaire_c_minimaliste
@@ -0,0 +1,52 @@
+les fonctions (avec parametres)
+le if
+le while
+les declarations
+les affectations
+les operations arith.
+le retour de fonction
+l'invocation de fonctions
+
+
+C : Fonctions ;
+Fonctions : Fonction Fonctions | Fonction ;
+
+Fonction : tInt tID tPO Params tPF Body ;
+
+Params : | Param SuiteParams ;
+Param : tInt tID ;
+
+SuiteParams : tVirgule Param SuiteParams | ;
+
+// Ps : P Ps | ;
+// P : tInt tID tVirgule
+// Ps =>* tInt tID tVirgule tInt tID tVirgule
+// Ps => P Ps => P P Ps ...
+
+Body : tAO Instructions tAF ;
+
+Instructions : Instruction Instructions | ;
+
+Instruction : Aff | If | While | Return | Decl | Invocation tPV ;
+
+Aff : tID tEQ E tPV ;
+
+E : tNB | tID | E tADD E | E tMUL E | E tMINUS E | E tDIV E | Invocation | tPO E tPF | tMINUS E ;
+
+// E : tID tADD tID | ...
+
+If : tIF tPO Cond tPF Body ;
+
+Cond : Cond tAND Cond | Cond tOR Cond | E tEQ2 E | E tINF E | tNOT Cond ;
+
+Invocation : tID tPO Args tPF ;
+
+Args : .... cf params
+
+Return : tRET E tPV ;
+
+
+
+
+
+
diff --git a/Fichiers_Tests/progC b/Fichiers_Tests/progC
new file mode 100644
index 0000000..60f1c97
--- /dev/null
+++ b/Fichiers_Tests/progC
@@ -0,0 +1,15 @@
+int main(int x, int i){
+ const int a = 4;
+ const int a, b, c = 2 + a - 5 * (7 / 8) + 5;
+ printf(coucou);
+ int y = 7e8;
+ int res_2 = x + y;
+ if ( (a == 2) && b || c > (7*8)) {
+ }
+ else if (a) {
+ int x = 90;
+ } else {
+ int a = b;
+ }
+ printf(i);
+}
diff --git a/Lex_Yacc/a.out b/Lex_Yacc/a.out
new file mode 100755
index 0000000..5bacdb8
Binary files /dev/null and b/Lex_Yacc/a.out differ
diff --git a/Lex_Yacc/al.lex b/Lex_Yacc/al.lex
new file mode 100644
index 0000000..7d6de8b
--- /dev/null
+++ b/Lex_Yacc/al.lex
@@ -0,0 +1,43 @@
+%{
+#include "as.tab.h"
+int yywrap(void){return 1;}
+%}
+
+%%
+
+"main" { return tMAIN ;}
+"{" { return tOBRACKET;}
+"}" { return tCBRACKET; }
+"(" { return tOBRACE; }
+")" { return tCBRACE; }
+"const" { return tCONST; }
+"int" { return tINT; }
+"printf" { return tPRINTF; } //Degeu mais à degager
+"if" { return tIF; }
+"while" { return tWHILE; }
+"<" { return tLT; }
+">" { return tGT; }
+"==" { return tEQCOND; }
+"&&" { return tAND; }
+"||" { return tOR; }
+"else" { return tELSE;}
+
+
+[0-9]+ { yylval.nombre = atoi(yytext); return tNB; }
+[0-9]+e[0-9]+ { yylval.nombre = -1; return tNBEXP; } //Renvoyer le token tNB et pas tNBEXP
+"+" { return tADD; }
+"-" { return tSUB; }
+"*" { return tMUL; }
+"/" { return tDIV; }
+"=" { return tEQ; }
+";" { return tPV; }
+" " {} //Ne pas les retourner à Yacc
+" " {} //Ne pas les retourner à Yacc
+"," { return tCOMA; }
+"\n" {} //Ne pas les retourner à Yacc
+[a-zA-Z][a-zA-Z0-9_]* { strcpy(yylval.id, yytext); return tID; }
+. { return tERROR; }
+
+%%
+
+
diff --git a/Lex_Yacc/as.output b/Lex_Yacc/as.output
new file mode 100644
index 0000000..fabc4db
--- /dev/null
+++ b/Lex_Yacc/as.output
@@ -0,0 +1,1290 @@
+Terminaux inutilisés dans la grammaire
+
+ tERROR
+
+
+Grammaire
+
+ 0 $accept: Main $end
+
+ 1 Main: tINT tMAIN tOBRACE Params tCBRACE Body
+
+ 2 Params: %empty
+ 3 | Param SuiteParams
+
+ 4 Param: tINT tID
+
+ 5 SuiteParams: tCOMA Param SuiteParams
+ 6 | %empty
+
+ 7 Body: tOBRACKET Instructions tCBRACKET
+
+ 8 Instructions: Instruction Instructions
+ 9 | %empty
+
+ 10 Instruction: Aff
+ 11 | Decl
+ 12 | Invocation tPV
+ 13 | If
+ 14 | While
+
+ 15 If: tIF tOBRACE Cond tCBRACE Body Else
+
+ 16 Else: tELSE If
+ 17 | tELSE Body
+ 18 | %empty
+
+ 19 While: tWHILE tOBRACE Cond tCBRACE Body
+
+ 20 Cond: E SuiteCond
+
+ 21 SuiteCond: %empty
+ 22 | tAND E SuiteCond
+ 23 | tOR E SuiteCond
+
+ 24 Aff: tID tEQ E tPV
+
+ 25 E: tNB
+ 26 | tNBEXP
+ 27 | tID
+ 28 | E tMUL E
+ 29 | E tDIV E
+ 30 | E tSUB E
+ 31 | E tADD E
+ 32 | Invocation
+ 33 | tOBRACE E tCBRACE
+ 34 | tSUB E
+ 35 | E tEQCOND E
+ 36 | E tGT E
+ 37 | E tLT E
+ 38 | tNOT E
+
+ 39 Decl: tINT tID SuiteDecl FinDeclaration
+ 40 | tCONST tINT tID SuiteDecl tEQ E tPV
+
+ 41 SuiteDecl: tCOMA tID SuiteDecl
+ 42 | %empty
+
+ 43 FinDeclaration: tEQ E tPV
+ 44 | tPV
+
+ 45 Invocation: tPRINTF tOBRACE tID tCBRACE
+
+
+Terminaux, suivis des règles où ils apparaissent
+
+$end (0) 0
+error (256)
+tMAIN (258) 1
+tOBRACKET (259) 7
+tCBRACKET (260) 7
+tOBRACE (261) 1 15 19 33 45
+tCBRACE (262) 1 15 19 33 45
+tINT (263) 1 4 39 40
+tCONST (264) 40
+tPV (265) 12 24 40 43 44
+tCOMA (266) 5 41
+tMUL (267) 28
+tDIV (268) 29
+tADD (269) 31
+tSUB (270) 30 34
+tEQ (271) 24 40 43
+tNB (272) 25
+tNBEXP (273) 26
+tID (274) 4 24 27 39 40 41 45
+tPRINTF (275) 45
+tERROR (276)
+tIF (277) 15
+tWHILE (278) 19
+tELSE (279) 16 17
+tLT (280) 37
+tGT (281) 36
+tEQCOND (282) 35
+tAND (283) 22
+tOR (284) 23
+tNOT (285) 38
+
+
+Non-terminaux, suivis des règles où ils apparaissent
+
+$accept (31)
+ à gauche: 0
+Main (32)
+ à gauche: 1, à droite: 0
+Params (33)
+ à gauche: 2 3, à droite: 1
+Param (34)
+ à gauche: 4, à droite: 3 5
+SuiteParams (35)
+ à gauche: 5 6, à droite: 3 5
+Body (36)
+ à gauche: 7, à droite: 1 15 17 19
+Instructions (37)
+ à gauche: 8 9, à droite: 7 8
+Instruction (38)
+ à gauche: 10 11 12 13 14, à droite: 8
+If (39)
+ à gauche: 15, à droite: 13 16
+Else (40)
+ à gauche: 16 17 18, à droite: 15
+While (41)
+ à gauche: 19, à droite: 14
+Cond (42)
+ à gauche: 20, à droite: 15 19
+SuiteCond (43)
+ à gauche: 21 22 23, à droite: 20 22 23
+Aff (44)
+ à gauche: 24, à droite: 10
+E (45)
+ à gauche: 25 26 27 28 29 30 31 32 33 34 35 36 37 38, à droite:
+ 20 22 23 24 28 29 30 31 33 34 35 36 37 38 40 43
+Decl (46)
+ à gauche: 39 40, à droite: 11
+SuiteDecl (47)
+ à gauche: 41 42, à droite: 39 40 41
+FinDeclaration (48)
+ à gauche: 43 44, à droite: 39
+Invocation (49)
+ à gauche: 45, à droite: 12 32
+
+
+État 0
+
+ 0 $accept: . Main $end
+
+ tINT décalage et aller à l'état 1
+
+ Main aller à l'état 2
+
+
+État 1
+
+ 1 Main: tINT . tMAIN tOBRACE Params tCBRACE Body
+
+ tMAIN décalage et aller à l'état 3
+
+
+État 2
+
+ 0 $accept: Main . $end
+
+ $end décalage et aller à l'état 4
+
+
+État 3
+
+ 1 Main: tINT tMAIN . tOBRACE Params tCBRACE Body
+
+ tOBRACE décalage et aller à l'état 5
+
+
+État 4
+
+ 0 $accept: Main $end .
+
+ $défaut accepter
+
+
+État 5
+
+ 1 Main: tINT tMAIN tOBRACE . Params tCBRACE Body
+
+ tINT décalage et aller à l'état 6
+
+ $défaut réduction par utilisation de la règle 2 (Params)
+
+ Params aller à l'état 7
+ Param aller à l'état 8
+
+
+État 6
+
+ 4 Param: tINT . tID
+
+ tID décalage et aller à l'état 9
+
+
+État 7
+
+ 1 Main: tINT tMAIN tOBRACE Params . tCBRACE Body
+
+ tCBRACE décalage et aller à l'état 10
+
+
+État 8
+
+ 3 Params: Param . SuiteParams
+
+ tCOMA décalage et aller à l'état 11
+
+ $défaut réduction par utilisation de la règle 6 (SuiteParams)
+
+ SuiteParams aller à l'état 12
+
+
+État 9
+
+ 4 Param: tINT tID .
+
+ $défaut réduction par utilisation de la règle 4 (Param)
+
+
+État 10
+
+ 1 Main: tINT tMAIN tOBRACE Params tCBRACE . Body
+
+ tOBRACKET décalage et aller à l'état 13
+
+ Body aller à l'état 14
+
+
+État 11
+
+ 5 SuiteParams: tCOMA . Param SuiteParams
+
+ tINT décalage et aller à l'état 6
+
+ Param aller à l'état 15
+
+
+État 12
+
+ 3 Params: Param SuiteParams .
+
+ $défaut réduction par utilisation de la règle 3 (Params)
+
+
+État 13
+
+ 7 Body: tOBRACKET . Instructions tCBRACKET
+
+ tINT décalage et aller à l'état 16
+ tCONST décalage et aller à l'état 17
+ tID décalage et aller à l'état 18
+ tPRINTF décalage et aller à l'état 19
+ tIF décalage et aller à l'état 20
+ tWHILE décalage et aller à l'état 21
+
+ $défaut réduction par utilisation de la règle 9 (Instructions)
+
+ Instructions aller à l'état 22
+ Instruction aller à l'état 23
+ If aller à l'état 24
+ While aller à l'état 25
+ Aff aller à l'état 26
+ Decl aller à l'état 27
+ Invocation aller à l'état 28
+
+
+État 14
+
+ 1 Main: tINT tMAIN tOBRACE Params tCBRACE Body .
+
+ $défaut réduction par utilisation de la règle 1 (Main)
+
+
+État 15
+
+ 5 SuiteParams: tCOMA Param . SuiteParams
+
+ tCOMA décalage et aller à l'état 11
+
+ $défaut réduction par utilisation de la règle 6 (SuiteParams)
+
+ SuiteParams aller à l'état 29
+
+
+État 16
+
+ 39 Decl: tINT . tID SuiteDecl FinDeclaration
+
+ tID décalage et aller à l'état 30
+
+
+État 17
+
+ 40 Decl: tCONST . tINT tID SuiteDecl tEQ E tPV
+
+ tINT décalage et aller à l'état 31
+
+
+État 18
+
+ 24 Aff: tID . tEQ E tPV
+
+ tEQ décalage et aller à l'état 32
+
+
+État 19
+
+ 45 Invocation: tPRINTF . tOBRACE tID tCBRACE
+
+ tOBRACE décalage et aller à l'état 33
+
+
+État 20
+
+ 15 If: tIF . tOBRACE Cond tCBRACE Body Else
+
+ tOBRACE décalage et aller à l'état 34
+
+
+État 21
+
+ 19 While: tWHILE . tOBRACE Cond tCBRACE Body
+
+ tOBRACE décalage et aller à l'état 35
+
+
+État 22
+
+ 7 Body: tOBRACKET Instructions . tCBRACKET
+
+ tCBRACKET décalage et aller à l'état 36
+
+
+État 23
+
+ 8 Instructions: Instruction . Instructions
+
+ tINT décalage et aller à l'état 16
+ tCONST décalage et aller à l'état 17
+ tID décalage et aller à l'état 18
+ tPRINTF décalage et aller à l'état 19
+ tIF décalage et aller à l'état 20
+ tWHILE décalage et aller à l'état 21
+
+ $défaut réduction par utilisation de la règle 9 (Instructions)
+
+ Instructions aller à l'état 37
+ Instruction aller à l'état 23
+ If aller à l'état 24
+ While aller à l'état 25
+ Aff aller à l'état 26
+ Decl aller à l'état 27
+ Invocation aller à l'état 28
+
+
+État 24
+
+ 13 Instruction: If .
+
+ $défaut réduction par utilisation de la règle 13 (Instruction)
+
+
+État 25
+
+ 14 Instruction: While .
+
+ $défaut réduction par utilisation de la règle 14 (Instruction)
+
+
+État 26
+
+ 10 Instruction: Aff .
+
+ $défaut réduction par utilisation de la règle 10 (Instruction)
+
+
+État 27
+
+ 11 Instruction: Decl .
+
+ $défaut réduction par utilisation de la règle 11 (Instruction)
+
+
+État 28
+
+ 12 Instruction: Invocation . tPV
+
+ tPV décalage et aller à l'état 38
+
+
+État 29
+
+ 5 SuiteParams: tCOMA Param SuiteParams .
+
+ $défaut réduction par utilisation de la règle 5 (SuiteParams)
+
+
+État 30
+
+ 39 Decl: tINT tID . SuiteDecl FinDeclaration
+
+ tCOMA décalage et aller à l'état 39
+
+ $défaut réduction par utilisation de la règle 42 (SuiteDecl)
+
+ SuiteDecl aller à l'état 40
+
+
+État 31
+
+ 40 Decl: tCONST tINT . tID SuiteDecl tEQ E tPV
+
+ tID décalage et aller à l'état 41
+
+
+État 32
+
+ 24 Aff: tID tEQ . E tPV
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 48
+ Invocation aller à l'état 49
+
+
+État 33
+
+ 45 Invocation: tPRINTF tOBRACE . tID tCBRACE
+
+ tID décalage et aller à l'état 50
+
+
+État 34
+
+ 15 If: tIF tOBRACE . Cond tCBRACE Body Else
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ Cond aller à l'état 51
+ E aller à l'état 52
+ Invocation aller à l'état 49
+
+
+État 35
+
+ 19 While: tWHILE tOBRACE . Cond tCBRACE Body
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ Cond aller à l'état 53
+ E aller à l'état 52
+ Invocation aller à l'état 49
+
+
+État 36
+
+ 7 Body: tOBRACKET Instructions tCBRACKET .
+
+ $défaut réduction par utilisation de la règle 7 (Body)
+
+
+État 37
+
+ 8 Instructions: Instruction Instructions .
+
+ $défaut réduction par utilisation de la règle 8 (Instructions)
+
+
+État 38
+
+ 12 Instruction: Invocation tPV .
+
+ $défaut réduction par utilisation de la règle 12 (Instruction)
+
+
+État 39
+
+ 41 SuiteDecl: tCOMA . tID SuiteDecl
+
+ tID décalage et aller à l'état 54
+
+
+État 40
+
+ 39 Decl: tINT tID SuiteDecl . FinDeclaration
+
+ tPV décalage et aller à l'état 55
+ tEQ décalage et aller à l'état 56
+
+ FinDeclaration aller à l'état 57
+
+
+État 41
+
+ 40 Decl: tCONST tINT tID . SuiteDecl tEQ E tPV
+
+ tCOMA décalage et aller à l'état 39
+
+ $défaut réduction par utilisation de la règle 42 (SuiteDecl)
+
+ SuiteDecl aller à l'état 58
+
+
+État 42
+
+ 33 E: tOBRACE . E tCBRACE
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 59
+ Invocation aller à l'état 49
+
+
+État 43
+
+ 34 E: tSUB . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 60
+ Invocation aller à l'état 49
+
+
+État 44
+
+ 25 E: tNB .
+
+ $défaut réduction par utilisation de la règle 25 (E)
+
+
+État 45
+
+ 26 E: tNBEXP .
+
+ $défaut réduction par utilisation de la règle 26 (E)
+
+
+État 46
+
+ 27 E: tID .
+
+ $défaut réduction par utilisation de la règle 27 (E)
+
+
+État 47
+
+ 38 E: tNOT . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 61
+ Invocation aller à l'état 49
+
+
+État 48
+
+ 24 Aff: tID tEQ E . tPV
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tPV décalage et aller à l'état 62
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+
+
+État 49
+
+ 32 E: Invocation .
+
+ $défaut réduction par utilisation de la règle 32 (E)
+
+
+État 50
+
+ 45 Invocation: tPRINTF tOBRACE tID . tCBRACE
+
+ tCBRACE décalage et aller à l'état 70
+
+
+État 51
+
+ 15 If: tIF tOBRACE Cond . tCBRACE Body Else
+
+ tCBRACE décalage et aller à l'état 71
+
+
+État 52
+
+ 20 Cond: E . SuiteCond
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+ tAND décalage et aller à l'état 72
+ tOR décalage et aller à l'état 73
+
+ $défaut réduction par utilisation de la règle 21 (SuiteCond)
+
+ SuiteCond aller à l'état 74
+
+
+État 53
+
+ 19 While: tWHILE tOBRACE Cond . tCBRACE Body
+
+ tCBRACE décalage et aller à l'état 75
+
+
+État 54
+
+ 41 SuiteDecl: tCOMA tID . SuiteDecl
+
+ tCOMA décalage et aller à l'état 39
+
+ $défaut réduction par utilisation de la règle 42 (SuiteDecl)
+
+ SuiteDecl aller à l'état 76
+
+
+État 55
+
+ 44 FinDeclaration: tPV .
+
+ $défaut réduction par utilisation de la règle 44 (FinDeclaration)
+
+
+État 56
+
+ 43 FinDeclaration: tEQ . E tPV
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 77
+ Invocation aller à l'état 49
+
+
+État 57
+
+ 39 Decl: tINT tID SuiteDecl FinDeclaration .
+
+ $défaut réduction par utilisation de la règle 39 (Decl)
+
+
+État 58
+
+ 40 Decl: tCONST tINT tID SuiteDecl . tEQ E tPV
+
+ tEQ décalage et aller à l'état 78
+
+
+État 59
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 33 | tOBRACE E . tCBRACE
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tCBRACE décalage et aller à l'état 79
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+
+
+État 60
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 34 | tSUB E .
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+
+ $défaut réduction par utilisation de la règle 34 (E)
+
+
+État 61
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+ 38 | tNOT E .
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+
+ $défaut réduction par utilisation de la règle 38 (E)
+
+
+État 62
+
+ 24 Aff: tID tEQ E tPV .
+
+ $défaut réduction par utilisation de la règle 24 (Aff)
+
+
+État 63
+
+ 28 E: E tMUL . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 80
+ Invocation aller à l'état 49
+
+
+État 64
+
+ 29 E: E tDIV . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 81
+ Invocation aller à l'état 49
+
+
+État 65
+
+ 31 E: E tADD . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 82
+ Invocation aller à l'état 49
+
+
+État 66
+
+ 30 E: E tSUB . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 83
+ Invocation aller à l'état 49
+
+
+État 67
+
+ 37 E: E tLT . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 84
+ Invocation aller à l'état 49
+
+
+État 68
+
+ 36 E: E tGT . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 85
+ Invocation aller à l'état 49
+
+
+État 69
+
+ 35 E: E tEQCOND . E
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 86
+ Invocation aller à l'état 49
+
+
+État 70
+
+ 45 Invocation: tPRINTF tOBRACE tID tCBRACE .
+
+ $défaut réduction par utilisation de la règle 45 (Invocation)
+
+
+État 71
+
+ 15 If: tIF tOBRACE Cond tCBRACE . Body Else
+
+ tOBRACKET décalage et aller à l'état 13
+
+ Body aller à l'état 87
+
+
+État 72
+
+ 22 SuiteCond: tAND . E SuiteCond
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 88
+ Invocation aller à l'état 49
+
+
+État 73
+
+ 23 SuiteCond: tOR . E SuiteCond
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 89
+ Invocation aller à l'état 49
+
+
+État 74
+
+ 20 Cond: E SuiteCond .
+
+ $défaut réduction par utilisation de la règle 20 (Cond)
+
+
+État 75
+
+ 19 While: tWHILE tOBRACE Cond tCBRACE . Body
+
+ tOBRACKET décalage et aller à l'état 13
+
+ Body aller à l'état 90
+
+
+État 76
+
+ 41 SuiteDecl: tCOMA tID SuiteDecl .
+
+ $défaut réduction par utilisation de la règle 41 (SuiteDecl)
+
+
+État 77
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+ 43 FinDeclaration: tEQ E . tPV
+
+ tPV décalage et aller à l'état 91
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+
+
+État 78
+
+ 40 Decl: tCONST tINT tID SuiteDecl tEQ . E tPV
+
+ tOBRACE décalage et aller à l'état 42
+ tSUB décalage et aller à l'état 43
+ tNB décalage et aller à l'état 44
+ tNBEXP décalage et aller à l'état 45
+ tID décalage et aller à l'état 46
+ tPRINTF décalage et aller à l'état 19
+ tNOT décalage et aller à l'état 47
+
+ E aller à l'état 92
+ Invocation aller à l'état 49
+
+
+État 79
+
+ 33 E: tOBRACE E tCBRACE .
+
+ $défaut réduction par utilisation de la règle 33 (E)
+
+
+État 80
+
+ 28 E: E . tMUL E
+ 28 | E tMUL E .
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ $défaut réduction par utilisation de la règle 28 (E)
+
+
+État 81
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 29 | E tDIV E .
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ $défaut réduction par utilisation de la règle 29 (E)
+
+
+État 82
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 31 | E tADD E .
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+
+ $défaut réduction par utilisation de la règle 31 (E)
+
+
+État 83
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 30 | E tSUB E .
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+
+ $défaut réduction par utilisation de la règle 30 (E)
+
+
+État 84
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+ 37 | E tLT E .
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tEQCOND décalage et aller à l'état 69
+
+ $défaut réduction par utilisation de la règle 37 (E)
+
+
+État 85
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 36 | E tGT E .
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tEQCOND décalage et aller à l'état 69
+
+ $défaut réduction par utilisation de la règle 36 (E)
+
+
+État 86
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 35 | E tEQCOND E .
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+
+ $défaut réduction par utilisation de la règle 35 (E)
+
+
+État 87
+
+ 15 If: tIF tOBRACE Cond tCBRACE Body . Else
+
+ tELSE décalage et aller à l'état 93
+
+ $défaut réduction par utilisation de la règle 18 (Else)
+
+ Else aller à l'état 94
+
+
+État 88
+
+ 22 SuiteCond: tAND E . SuiteCond
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+ tAND décalage et aller à l'état 72
+ tOR décalage et aller à l'état 73
+
+ $défaut réduction par utilisation de la règle 21 (SuiteCond)
+
+ SuiteCond aller à l'état 95
+
+
+État 89
+
+ 23 SuiteCond: tOR E . SuiteCond
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+ tAND décalage et aller à l'état 72
+ tOR décalage et aller à l'état 73
+
+ $défaut réduction par utilisation de la règle 21 (SuiteCond)
+
+ SuiteCond aller à l'état 96
+
+
+État 90
+
+ 19 While: tWHILE tOBRACE Cond tCBRACE Body .
+
+ $défaut réduction par utilisation de la règle 19 (While)
+
+
+État 91
+
+ 43 FinDeclaration: tEQ E tPV .
+
+ $défaut réduction par utilisation de la règle 43 (FinDeclaration)
+
+
+État 92
+
+ 28 E: E . tMUL E
+ 29 | E . tDIV E
+ 30 | E . tSUB E
+ 31 | E . tADD E
+ 35 | E . tEQCOND E
+ 36 | E . tGT E
+ 37 | E . tLT E
+ 40 Decl: tCONST tINT tID SuiteDecl tEQ E . tPV
+
+ tPV décalage et aller à l'état 97
+ tMUL décalage et aller à l'état 63
+ tDIV décalage et aller à l'état 64
+ tADD décalage et aller à l'état 65
+ tSUB décalage et aller à l'état 66
+ tLT décalage et aller à l'état 67
+ tGT décalage et aller à l'état 68
+ tEQCOND décalage et aller à l'état 69
+
+
+État 93
+
+ 16 Else: tELSE . If
+ 17 | tELSE . Body
+
+ tOBRACKET décalage et aller à l'état 13
+ tIF décalage et aller à l'état 20
+
+ Body aller à l'état 98
+ If aller à l'état 99
+
+
+État 94
+
+ 15 If: tIF tOBRACE Cond tCBRACE Body Else .
+
+ $défaut réduction par utilisation de la règle 15 (If)
+
+
+État 95
+
+ 22 SuiteCond: tAND E SuiteCond .
+
+ $défaut réduction par utilisation de la règle 22 (SuiteCond)
+
+
+État 96
+
+ 23 SuiteCond: tOR E SuiteCond .
+
+ $défaut réduction par utilisation de la règle 23 (SuiteCond)
+
+
+État 97
+
+ 40 Decl: tCONST tINT tID SuiteDecl tEQ E tPV .
+
+ $défaut réduction par utilisation de la règle 40 (Decl)
+
+
+État 98
+
+ 17 Else: tELSE Body .
+
+ $défaut réduction par utilisation de la règle 17 (Else)
+
+
+État 99
+
+ 16 Else: tELSE If .
+
+ $défaut réduction par utilisation de la règle 16 (Else)
diff --git a/Lex_Yacc/as.tab.c b/Lex_Yacc/as.tab.c
new file mode 100644
index 0000000..d268e6a
--- /dev/null
+++ b/Lex_Yacc/as.tab.c
@@ -0,0 +1,1714 @@
+/* A Bison parser, made by GNU Bison 3.0.4. */
+
+/* Bison implementation for Yacc-like parsers in C
+
+ Copyright (C) 1984, 1989-1990, 2000-2015 Free Software Foundation, Inc.
+
+ 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 3 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, see . */
+
+/* As a special exception, you may create a larger work that contains
+ part or all of the Bison parser skeleton and distribute that work
+ under terms of your choice, so long as that work isn't itself a
+ parser generator using the skeleton or a modified version thereof
+ as a parser skeleton. Alternatively, if you modify or redistribute
+ the parser skeleton itself, you may (at your option) remove this
+ special exception, which will cause the skeleton and the resulting
+ Bison output files to be licensed under the GNU General Public
+ License without this special exception.
+
+ This special exception was added by the Free Software Foundation in
+ version 2.2 of Bison. */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+ simplifying the original so-called "semantic" parser. */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+ infringing on user name space. This should be done even for local
+ variables, as they might otherwise be expanded by user macros.
+ There are some unavoidable exceptions within include files to
+ define necessary library symbols; they are noted "INFRINGES ON
+ USER NAME SPACE" below. */
+
+/* Identify Bison output. */
+#define YYBISON 1
+
+/* Bison version. */
+#define YYBISON_VERSION "3.0.4"
+
+/* Skeleton name. */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers. */
+#define YYPURE 0
+
+/* Push parsers. */
+#define YYPUSH 0
+
+/* Pull parsers. */
+#define YYPULL 1
+
+
+
+
+/* Copy the first part of user declarations. */
+
+#line 67 "as.tab.c" /* yacc.c:339 */
+
+# ifndef YY_NULLPTR
+# if defined __cplusplus && 201103L <= __cplusplus
+# define YY_NULLPTR nullptr
+# else
+# define YY_NULLPTR 0
+# endif
+# endif
+
+/* Enabling verbose error messages. */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 0
+#endif
+
+/* In a future release of Bison, this section will be replaced
+ by #include "as.tab.h". */
+#ifndef YY_YY_AS_TAB_H_INCLUDED
+# define YY_YY_AS_TAB_H_INCLUDED
+/* Debug traces. */
+#ifndef YYDEBUG
+# define YYDEBUG 1
+#endif
+#if YYDEBUG
+extern int yydebug;
+#endif
+
+/* Token type. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ enum yytokentype
+ {
+ tMAIN = 258,
+ tOBRACKET = 259,
+ tCBRACKET = 260,
+ tOBRACE = 261,
+ tCBRACE = 262,
+ tINT = 263,
+ tCONST = 264,
+ tPV = 265,
+ tCOMA = 266,
+ tMUL = 267,
+ tDIV = 268,
+ tADD = 269,
+ tSUB = 270,
+ tEQ = 271,
+ tNB = 272,
+ tNBEXP = 273,
+ tID = 274,
+ tPRINTF = 275,
+ tERROR = 276,
+ tIF = 277,
+ tWHILE = 278,
+ tELSE = 279,
+ tLT = 280,
+ tGT = 281,
+ tEQCOND = 282,
+ tAND = 283,
+ tOR = 284,
+ tNOT = 285
+ };
+#endif
+
+/* Value type. */
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+
+union YYSTYPE
+{
+#line 1 "as.y" /* yacc.c:355 */
+
+ int nombre;
+ char id[30];
+
+#line 143 "as.tab.c" /* yacc.c:355 */
+};
+
+typedef union YYSTYPE YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+extern YYSTYPE yylval;
+
+int yyparse (void);
+
+#endif /* !YY_YY_AS_TAB_H_INCLUDED */
+
+/* Copy the second part of user declarations. */
+#line 5 "as.y" /* yacc.c:358 */
+
+#include "../Symboles/table_symboles.h"
+#include
+
+int addr = 0;
+
+#line 166 "as.tab.c" /* yacc.c:358 */
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#else
+typedef signed char yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+# define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+# define YYSIZE_T size_t
+# elif ! defined YYSIZE_T
+# include /* INFRINGES ON USER NAME SPACE */
+# define YYSIZE_T size_t
+# else
+# define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+# if ENABLE_NLS
+# include /* INFRINGES ON USER NAME SPACE */
+# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
+# endif
+# endif
+# ifndef YY_
+# define YY_(Msgid) Msgid
+# endif
+#endif
+
+#ifndef YY_ATTRIBUTE
+# if (defined __GNUC__ \
+ && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \
+ || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C
+# define YY_ATTRIBUTE(Spec) __attribute__(Spec)
+# else
+# define YY_ATTRIBUTE(Spec) /* empty */
+# endif
+#endif
+
+#ifndef YY_ATTRIBUTE_PURE
+# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__))
+#endif
+
+#ifndef YY_ATTRIBUTE_UNUSED
+# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__))
+#endif
+
+#if !defined _Noreturn \
+ && (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112)
+# if defined _MSC_VER && 1200 <= _MSC_VER
+# define _Noreturn __declspec (noreturn)
+# else
+# define _Noreturn YY_ATTRIBUTE ((__noreturn__))
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E. */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(E) ((void) (E))
+#else
+# define YYUSE(E) /* empty */
+#endif
+
+#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
+/* Suppress an incorrect diagnostic about yylval being uninitialized. */
+# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
+ _Pragma ("GCC diagnostic push") \
+ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\
+ _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
+# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
+ _Pragma ("GCC diagnostic pop")
+#else
+# define YY_INITIAL_VALUE(Value) Value
+#endif
+#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+# define YY_IGNORE_MAYBE_UNINITIALIZED_END
+#endif
+#ifndef YY_INITIAL_VALUE
+# define YY_INITIAL_VALUE(Value) /* Nothing. */
+#endif
+
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols. */
+
+# ifdef YYSTACK_USE_ALLOCA
+# if YYSTACK_USE_ALLOCA
+# ifdef __GNUC__
+# define YYSTACK_ALLOC __builtin_alloca
+# elif defined __BUILTIN_VA_ARG_INCR
+# include /* INFRINGES ON USER NAME SPACE */
+# elif defined _AIX
+# define YYSTACK_ALLOC __alloca
+# elif defined _MSC_VER
+# include /* INFRINGES ON USER NAME SPACE */
+# define alloca _alloca
+# else
+# define YYSTACK_ALLOC alloca
+# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
+# include /* INFRINGES ON USER NAME SPACE */
+ /* Use EXIT_SUCCESS as a witness for stdlib.h. */
+# ifndef EXIT_SUCCESS
+# define EXIT_SUCCESS 0
+# endif
+# endif
+# endif
+# endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+ /* Pacify GCC's 'empty if-body' warning. */
+# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
+# ifndef YYSTACK_ALLOC_MAXIMUM
+ /* The OS might guarantee only one guard page at the bottom of the stack,
+ and a page size can be as small as 4096 bytes. So we cannot safely
+ invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
+ to allow for a few compiler-allocated temporary stack slots. */
+# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+# endif
+# else
+# define YYSTACK_ALLOC YYMALLOC
+# define YYSTACK_FREE YYFREE
+# ifndef YYSTACK_ALLOC_MAXIMUM
+# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+# endif
+# if (defined __cplusplus && ! defined EXIT_SUCCESS \
+ && ! ((defined YYMALLOC || defined malloc) \
+ && (defined YYFREE || defined free)))
+# include /* INFRINGES ON USER NAME SPACE */
+# ifndef EXIT_SUCCESS
+# define EXIT_SUCCESS 0
+# endif
+# endif
+# ifndef YYMALLOC
+# define YYMALLOC malloc
+# if ! defined malloc && ! defined EXIT_SUCCESS
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+# endif
+# endif
+# ifndef YYFREE
+# define YYFREE free
+# if ! defined free && ! defined EXIT_SUCCESS
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+# endif
+# endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+ && (! defined __cplusplus \
+ || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member. */
+union yyalloc
+{
+ yytype_int16 yyss_alloc;
+ YYSTYPE yyvs_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next. */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+ N elements. */
+# define YYSTACK_BYTES(N) \
+ ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ + YYSTACK_GAP_MAXIMUM)
+
+# define YYCOPY_NEEDED 1
+
+/* Relocate STACK from its old location to the new one. The
+ local variables YYSIZE and YYSTACKSIZE give the old and new number of
+ elements in the stack, and YYPTR gives the new location of the
+ stack. Advance YYPTR to a properly aligned location for the next
+ stack. */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
+ do \
+ { \
+ YYSIZE_T yynewbytes; \
+ YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
+ Stack = &yyptr->Stack_alloc; \
+ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+ yyptr += yynewbytes / sizeof (*yyptr); \
+ } \
+ while (0)
+
+#endif
+
+#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
+/* Copy COUNT objects from SRC to DST. The source and destination do
+ not overlap. */
+# ifndef YYCOPY
+# if defined __GNUC__ && 1 < __GNUC__
+# define YYCOPY(Dst, Src, Count) \
+ __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src)))
+# else
+# define YYCOPY(Dst, Src, Count) \
+ do \
+ { \
+ YYSIZE_T yyi; \
+ for (yyi = 0; yyi < (Count); yyi++) \
+ (Dst)[yyi] = (Src)[yyi]; \
+ } \
+ while (0)
+# endif
+# endif
+#endif /* !YYCOPY_NEEDED */
+
+/* YYFINAL -- State number of the termination state. */
+#define YYFINAL 4
+/* YYLAST -- Last index in YYTABLE. */
+#define YYLAST 130
+
+/* YYNTOKENS -- Number of terminals. */
+#define YYNTOKENS 31
+/* YYNNTS -- Number of nonterminals. */
+#define YYNNTS 19
+/* YYNRULES -- Number of rules. */
+#define YYNRULES 46
+/* YYNSTATES -- Number of states. */
+#define YYNSTATES 100
+
+/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
+ by yylex, with out-of-bounds checking. */
+#define YYUNDEFTOK 2
+#define YYMAXUTOK 285
+
+#define YYTRANSLATE(YYX) \
+ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
+ as returned by yylex, without out-of-bounds checking. */
+static const yytype_uint8 yytranslate[] =
+{
+ 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 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
+};
+
+#if YYDEBUG
+ /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
+static const yytype_uint8 yyrline[] =
+{
+ 0, 40, 40, 42, 43, 44, 45, 46, 48, 51,
+ 52, 53, 54, 55, 56, 57, 60, 61, 62, 63,
+ 64, 66, 67, 68, 69, 72, 74, 75, 76, 77,
+ 78, 79, 80, 81, 82, 83, 84, 85, 86, 87,
+ 90, 91, 92, 93, 94, 95, 97
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || 0
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+ First, the terminals, then, starting at YYNTOKENS, nonterminals. */
+static const char *const yytname[] =
+{
+ "$end", "error", "$undefined", "tMAIN", "tOBRACKET", "tCBRACKET",
+ "tOBRACE", "tCBRACE", "tINT", "tCONST", "tPV", "tCOMA", "tMUL", "tDIV",
+ "tADD", "tSUB", "tEQ", "tNB", "tNBEXP", "tID", "tPRINTF", "tERROR",
+ "tIF", "tWHILE", "tELSE", "tLT", "tGT", "tEQCOND", "tAND", "tOR", "tNOT",
+ "$accept", "Main", "Params", "Param", "SuiteParams", "Body",
+ "Instructions", "Instruction", "If", "Else", "While", "Cond",
+ "SuiteCond", "Aff", "E", "Decl", "SuiteDecl", "FinDeclaration",
+ "Invocation", YY_NULLPTR
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[NUM] -- (External) token number corresponding to the
+ (internal) symbol number NUM (which must be that of a token). */
+static const yytype_uint16 yytoknum[] =
+{
+ 0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
+ 265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
+ 275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
+ 285
+};
+# endif
+
+#define YYPACT_NINF -69
+
+#define yypact_value_is_default(Yystate) \
+ (!!((Yystate) == (-69)))
+
+#define YYTABLE_NINF -1
+
+#define yytable_value_is_error(Yytable_value) \
+ 0
+
+ /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+ STATE-NUM. */
+static const yytype_int8 yypact[] =
+{
+ -7, 1, 9, 16, -69, 20, 11, 50, 32, -69,
+ 66, 20, -69, 36, -69, 32, 44, 68, 67, 75,
+ 76, 81, 84, 36, -69, -69, -69, -69, 78, -69,
+ 96, 92, -1, 97, -1, -1, -69, -69, -69, 98,
+ -4, 96, -1, -1, -69, -69, -69, -1, 59, -69,
+ 108, 116, 39, 117, 96, -69, -1, -69, 109, 35,
+ 14, 87, -69, -1, -1, -1, -1, -1, -1, -1,
+ -69, 66, -1, -1, -69, 66, -69, 65, -1, -69,
+ -69, -69, 14, 14, 91, 91, 107, 70, 39, 39,
+ -69, -69, 83, -2, -69, -69, -69, -69, -69, -69
+};
+
+ /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
+ Performed when YYTABLE does not specify something else to do. Zero
+ means the default is an error. */
+static const yytype_uint8 yydefact[] =
+{
+ 0, 0, 0, 0, 1, 3, 0, 0, 7, 5,
+ 0, 0, 4, 10, 2, 7, 0, 0, 0, 0,
+ 0, 0, 0, 10, 14, 15, 11, 12, 0, 6,
+ 43, 0, 0, 0, 0, 0, 8, 9, 13, 0,
+ 0, 43, 0, 0, 26, 27, 28, 0, 0, 33,
+ 0, 0, 22, 0, 43, 45, 0, 40, 0, 0,
+ 35, 39, 25, 0, 0, 0, 0, 0, 0, 0,
+ 46, 0, 0, 0, 21, 0, 42, 0, 0, 34,
+ 29, 30, 32, 31, 38, 37, 36, 19, 22, 22,
+ 20, 44, 0, 0, 16, 23, 24, 41, 18, 17
+};
+
+ /* YYPGOTO[NTERM-NUM]. */
+static const yytype_int8 yypgoto[] =
+{
+ -69, -69, -69, 115, 112, -68, 105, -69, 37, -69,
+ -69, 94, -50, -69, -32, -69, -33, -69, 0
+};
+
+ /* YYDEFGOTO[NTERM-NUM]. */
+static const yytype_int8 yydefgoto[] =
+{
+ -1, 2, 7, 8, 12, 14, 22, 23, 24, 94,
+ 25, 51, 74, 26, 52, 27, 40, 57, 49
+};
+
+ /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
+ positive, shift that token. If negative, reduce the rule whose
+ number is the opposite. If YYTABLE_NINF, syntax error. */
+static const yytype_uint8 yytable[] =
+{
+ 48, 1, 13, 87, 3, 42, 55, 90, 58, 4,
+ 59, 60, 56, 28, 43, 61, 44, 45, 46, 19,
+ 20, 76, 5, 28, 77, 98, 63, 64, 6, 47,
+ 9, 80, 81, 82, 83, 84, 85, 86, 95, 96,
+ 88, 89, 79, 11, 16, 17, 92, 63, 64, 65,
+ 66, 63, 64, 65, 66, 18, 19, 10, 20, 21,
+ 67, 68, 69, 30, 67, 68, 69, 72, 73, 62,
+ 13, 63, 64, 65, 66, 91, 31, 63, 64, 65,
+ 66, 33, 34, 32, 67, 68, 69, 35, 38, 36,
+ 67, 68, 69, 97, 93, 63, 64, 65, 66, 63,
+ 64, 65, 66, 63, 64, 65, 66, 39, 67, 68,
+ 69, 41, 67, 68, 69, 70, 50, 54, 69, 63,
+ 64, 65, 66, 71, 75, 78, 15, 29, 37, 53,
+ 99
+};
+
+static const yytype_uint8 yycheck[] =
+{
+ 32, 8, 4, 71, 3, 6, 10, 75, 41, 0,
+ 42, 43, 16, 13, 15, 47, 17, 18, 19, 20,
+ 22, 54, 6, 23, 56, 93, 12, 13, 8, 30,
+ 19, 63, 64, 65, 66, 67, 68, 69, 88, 89,
+ 72, 73, 7, 11, 8, 9, 78, 12, 13, 14,
+ 15, 12, 13, 14, 15, 19, 20, 7, 22, 23,
+ 25, 26, 27, 19, 25, 26, 27, 28, 29, 10,
+ 4, 12, 13, 14, 15, 10, 8, 12, 13, 14,
+ 15, 6, 6, 16, 25, 26, 27, 6, 10, 5,
+ 25, 26, 27, 10, 24, 12, 13, 14, 15, 12,
+ 13, 14, 15, 12, 13, 14, 15, 11, 25, 26,
+ 27, 19, 25, 26, 27, 7, 19, 19, 27, 12,
+ 13, 14, 15, 7, 7, 16, 11, 15, 23, 35,
+ 93
+};
+
+ /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+ symbol of state STATE-NUM. */
+static const yytype_uint8 yystos[] =
+{
+ 0, 8, 32, 3, 0, 6, 8, 33, 34, 19,
+ 7, 11, 35, 4, 36, 34, 8, 9, 19, 20,
+ 22, 23, 37, 38, 39, 41, 44, 46, 49, 35,
+ 19, 8, 16, 6, 6, 6, 5, 37, 10, 11,
+ 47, 19, 6, 15, 17, 18, 19, 30, 45, 49,
+ 19, 42, 45, 42, 19, 10, 16, 48, 47, 45,
+ 45, 45, 10, 12, 13, 14, 15, 25, 26, 27,
+ 7, 7, 28, 29, 43, 7, 47, 45, 16, 7,
+ 45, 45, 45, 45, 45, 45, 45, 36, 45, 45,
+ 36, 10, 45, 24, 40, 43, 43, 10, 36, 39
+};
+
+ /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
+static const yytype_uint8 yyr1[] =
+{
+ 0, 31, 32, 33, 33, 34, 35, 35, 36, 37,
+ 37, 38, 38, 38, 38, 38, 39, 40, 40, 40,
+ 41, 42, 43, 43, 43, 44, 45, 45, 45, 45,
+ 45, 45, 45, 45, 45, 45, 45, 45, 45, 45,
+ 46, 46, 47, 47, 48, 48, 49
+};
+
+ /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
+static const yytype_uint8 yyr2[] =
+{
+ 0, 2, 6, 0, 2, 2, 3, 0, 3, 2,
+ 0, 1, 1, 2, 1, 1, 6, 2, 2, 0,
+ 5, 2, 0, 3, 3, 4, 1, 1, 1, 3,
+ 3, 3, 3, 1, 3, 2, 3, 3, 3, 2,
+ 4, 7, 3, 0, 3, 1, 4
+};
+
+
+#define yyerrok (yyerrstatus = 0)
+#define yyclearin (yychar = YYEMPTY)
+#define YYEMPTY (-2)
+#define YYEOF 0
+
+#define YYACCEPT goto yyacceptlab
+#define YYABORT goto yyabortlab
+#define YYERROR goto yyerrorlab
+
+
+#define YYRECOVERING() (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value) \
+do \
+ if (yychar == YYEMPTY) \
+ { \
+ yychar = (Token); \
+ yylval = (Value); \
+ YYPOPSTACK (yylen); \
+ yystate = *yyssp; \
+ goto yybackup; \
+ } \
+ else \
+ { \
+ yyerror (YY_("syntax error: cannot back up")); \
+ YYERROR; \
+ } \
+while (0)
+
+/* Error token number */
+#define YYTERROR 1
+#define YYERRCODE 256
+
+
+
+/* Enable debugging if requested. */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+# include /* INFRINGES ON USER NAME SPACE */
+# define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args) \
+do { \
+ if (yydebug) \
+ YYFPRINTF Args; \
+} while (0)
+
+/* This macro is provided for backward compatibility. */
+#ifndef YY_LOCATION_PRINT
+# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+#endif
+
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
+do { \
+ if (yydebug) \
+ { \
+ YYFPRINTF (stderr, "%s ", Title); \
+ yy_symbol_print (stderr, \
+ Type, Value); \
+ YYFPRINTF (stderr, "\n"); \
+ } \
+} while (0)
+
+
+/*----------------------------------------.
+| Print this symbol's value on YYOUTPUT. |
+`----------------------------------------*/
+
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
+{
+ FILE *yyo = yyoutput;
+ YYUSE (yyo);
+ if (!yyvaluep)
+ return;
+# ifdef YYPRINT
+ if (yytype < YYNTOKENS)
+ YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# endif
+ YYUSE (yytype);
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT. |
+`--------------------------------*/
+
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
+{
+ YYFPRINTF (yyoutput, "%s %s (",
+ yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
+
+ yy_symbol_value_print (yyoutput, yytype, yyvaluep);
+ YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included). |
+`------------------------------------------------------------------*/
+
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+{
+ YYFPRINTF (stderr, "Stack now");
+ for (; yybottom <= yytop; yybottom++)
+ {
+ int yybot = *yybottom;
+ YYFPRINTF (stderr, " %d", yybot);
+ }
+ YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top) \
+do { \
+ if (yydebug) \
+ yy_stack_print ((Bottom), (Top)); \
+} while (0)
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced. |
+`------------------------------------------------*/
+
+static void
+yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule)
+{
+ unsigned long int yylno = yyrline[yyrule];
+ int yynrhs = yyr2[yyrule];
+ int yyi;
+ YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+ yyrule - 1, yylno);
+ /* The symbols being reduced. */
+ for (yyi = 0; yyi < yynrhs; yyi++)
+ {
+ YYFPRINTF (stderr, " $%d = ", yyi + 1);
+ yy_symbol_print (stderr,
+ yystos[yyssp[yyi + 1 - yynrhs]],
+ &(yyvsp[(yyi + 1) - (yynrhs)])
+ );
+ YYFPRINTF (stderr, "\n");
+ }
+}
+
+# define YY_REDUCE_PRINT(Rule) \
+do { \
+ if (yydebug) \
+ yy_reduce_print (yyssp, yyvsp, Rule); \
+} while (0)
+
+/* Nonzero means print parse trace. It is left uninitialized so that
+ multiple parsers can coexist. */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks. */
+#ifndef YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+ if the built-in stack extension method is used).
+
+ Do not make this value too large; the results are undefined if
+ YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+ evaluated with infinite-precision integer arithmetic. */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+# if defined __GLIBC__ && defined _STRING_H
+# define yystrlen strlen
+# else
+/* Return the length of YYSTR. */
+static YYSIZE_T
+yystrlen (const char *yystr)
+{
+ YYSIZE_T yylen;
+ for (yylen = 0; yystr[yylen]; yylen++)
+ continue;
+ return yylen;
+}
+# endif
+# endif
+
+# ifndef yystpcpy
+# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+# define yystpcpy stpcpy
+# else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+ YYDEST. */
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+{
+ char *yyd = yydest;
+ const char *yys = yysrc;
+
+ while ((*yyd++ = *yys++) != '\0')
+ continue;
+
+ return yyd - 1;
+}
+# endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+ quotes and backslashes, so that it's suitable for yyerror. The
+ heuristic is that double-quoting is unnecessary unless the string
+ contains an apostrophe, a comma, or backslash (other than
+ backslash-backslash). YYSTR is taken from yytname. If YYRES is
+ null, do not copy; instead, return the length of what the result
+ would have been. */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+ if (*yystr == '"')
+ {
+ YYSIZE_T yyn = 0;
+ char const *yyp = yystr;
+
+ for (;;)
+ switch (*++yyp)
+ {
+ case '\'':
+ case ',':
+ goto do_not_strip_quotes;
+
+ case '\\':
+ if (*++yyp != '\\')
+ goto do_not_strip_quotes;
+ /* Fall through. */
+ default:
+ if (yyres)
+ yyres[yyn] = *yyp;
+ yyn++;
+ break;
+
+ case '"':
+ if (yyres)
+ yyres[yyn] = '\0';
+ return yyn;
+ }
+ do_not_strip_quotes: ;
+ }
+
+ if (! yyres)
+ return yystrlen (yystr);
+
+ return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
+ about the unexpected token YYTOKEN for the state stack whose top is
+ YYSSP.
+
+ Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
+ not large enough to hold the message. In that case, also set
+ *YYMSG_ALLOC to the required number of bytes. Return 2 if the
+ required number of bytes is too large to store. */
+static int
+yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
+ yytype_int16 *yyssp, int yytoken)
+{
+ YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
+ YYSIZE_T yysize = yysize0;
+ enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+ /* Internationalized format string. */
+ const char *yyformat = YY_NULLPTR;
+ /* Arguments of yyformat. */
+ char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+ /* Number of reported tokens (one for the "unexpected", one per
+ "expected"). */
+ int yycount = 0;
+
+ /* There are many possibilities here to consider:
+ - If this state is a consistent state with a default action, then
+ the only way this function was invoked is if the default action
+ is an error action. In that case, don't check for expected
+ tokens because there are none.
+ - The only way there can be no lookahead present (in yychar) is if
+ this state is a consistent state with a default action. Thus,
+ detecting the absence of a lookahead is sufficient to determine
+ that there is no unexpected or expected token to report. In that
+ case, just report a simple "syntax error".
+ - Don't assume there isn't a lookahead just because this state is a
+ consistent state with a default action. There might have been a
+ previous inconsistent state, consistent state with a non-default
+ action, or user semantic action that manipulated yychar.
+ - Of course, the expected token list depends on states to have
+ correct lookahead information, and it depends on the parser not
+ to perform extra reductions after fetching a lookahead from the
+ scanner and before detecting a syntax error. Thus, state merging
+ (from LALR or IELR) and default reductions corrupt the expected
+ token list. However, the list is correct for canonical LR with
+ one exception: it will still contain any token that will not be
+ accepted due to an error action in a later state.
+ */
+ if (yytoken != YYEMPTY)
+ {
+ int yyn = yypact[*yyssp];
+ yyarg[yycount++] = yytname[yytoken];
+ if (!yypact_value_is_default (yyn))
+ {
+ /* Start YYX at -YYN if negative to avoid negative indexes in
+ YYCHECK. In other words, skip the first -YYN actions for
+ this state because they are default actions. */
+ int yyxbegin = yyn < 0 ? -yyn : 0;
+ /* Stay within bounds of both yycheck and yytname. */
+ int yychecklim = YYLAST - yyn + 1;
+ int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+ int yyx;
+
+ for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+ if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
+ && !yytable_value_is_error (yytable[yyx + yyn]))
+ {
+ if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+ {
+ yycount = 1;
+ yysize = yysize0;
+ break;
+ }
+ yyarg[yycount++] = yytname[yyx];
+ {
+ YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
+ if (! (yysize <= yysize1
+ && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+ return 2;
+ yysize = yysize1;
+ }
+ }
+ }
+ }
+
+ switch (yycount)
+ {
+# define YYCASE_(N, S) \
+ case N: \
+ yyformat = S; \
+ break
+ YYCASE_(0, YY_("syntax error"));
+ YYCASE_(1, YY_("syntax error, unexpected %s"));
+ YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
+ YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
+ YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
+ YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
+# undef YYCASE_
+ }
+
+ {
+ YYSIZE_T yysize1 = yysize + yystrlen (yyformat);
+ if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+ return 2;
+ yysize = yysize1;
+ }
+
+ if (*yymsg_alloc < yysize)
+ {
+ *yymsg_alloc = 2 * yysize;
+ if (! (yysize <= *yymsg_alloc
+ && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
+ *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
+ return 1;
+ }
+
+ /* Avoid sprintf, as that infringes on the user's name space.
+ Don't have undefined behavior even if the translation
+ produced a string with the wrong number of "%s"s. */
+ {
+ char *yyp = *yymsg;
+ int yyi = 0;
+ while ((*yyp = *yyformat) != '\0')
+ if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
+ {
+ yyp += yytnamerr (yyp, yyarg[yyi++]);
+ yyformat += 2;
+ }
+ else
+ {
+ yyp++;
+ yyformat++;
+ }
+ }
+ return 0;
+}
+#endif /* YYERROR_VERBOSE */
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol. |
+`-----------------------------------------------*/
+
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
+{
+ YYUSE (yyvaluep);
+ if (!yymsg)
+ yymsg = "Deleting";
+ YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+ YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+ YYUSE (yytype);
+ YY_IGNORE_MAYBE_UNINITIALIZED_END
+}
+
+
+
+
+/* The lookahead symbol. */
+int yychar;
+
+/* The semantic value of the lookahead symbol. */
+YYSTYPE yylval;
+/* Number of syntax errors so far. */
+int yynerrs;
+
+
+/*----------.
+| yyparse. |
+`----------*/
+
+int
+yyparse (void)
+{
+ int yystate;
+ /* Number of tokens to shift before error messages enabled. */
+ int yyerrstatus;
+
+ /* The stacks and their tools:
+ 'yyss': related to states.
+ 'yyvs': related to semantic values.
+
+ Refer to the stacks through separate pointers, to allow yyoverflow
+ to reallocate them elsewhere. */
+
+ /* The state stack. */
+ yytype_int16 yyssa[YYINITDEPTH];
+ yytype_int16 *yyss;
+ yytype_int16 *yyssp;
+
+ /* The semantic value stack. */
+ YYSTYPE yyvsa[YYINITDEPTH];
+ YYSTYPE *yyvs;
+ YYSTYPE *yyvsp;
+
+ YYSIZE_T yystacksize;
+
+ int yyn;
+ int yyresult;
+ /* Lookahead token as an internal (translated) token number. */
+ int yytoken = 0;
+ /* The variables used to return semantic value and location from the
+ action routines. */
+ YYSTYPE yyval;
+
+#if YYERROR_VERBOSE
+ /* Buffer for error messages, and its allocated size. */
+ char yymsgbuf[128];
+ char *yymsg = yymsgbuf;
+ YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
+
+ /* The number of symbols on the RHS of the reduced rule.
+ Keep to zero when no symbol should be popped. */
+ int yylen = 0;
+
+ yyssp = yyss = yyssa;
+ yyvsp = yyvs = yyvsa;
+ yystacksize = YYINITDEPTH;
+
+ YYDPRINTF ((stderr, "Starting parse\n"));
+
+ yystate = 0;
+ yyerrstatus = 0;
+ yynerrs = 0;
+ yychar = YYEMPTY; /* Cause a token to be read. */
+ goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate. |
+`------------------------------------------------------------*/
+ yynewstate:
+ /* In all cases, when you get here, the value and location stacks
+ have just been pushed. So pushing a state here evens the stacks. */
+ yyssp++;
+
+ yysetstate:
+ *yyssp = yystate;
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ {
+ /* Get the current used size of the three stacks, in elements. */
+ YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+ {
+ /* Give user a chance to reallocate the stack. Use copies of
+ these so that the &'s don't force the real ones into
+ memory. */
+ YYSTYPE *yyvs1 = yyvs;
+ yytype_int16 *yyss1 = yyss;
+
+ /* Each stack pointer address is followed by the size of the
+ data in use in that stack, in bytes. This used to be a
+ conditional around just the two extra args, but that might
+ be undefined if yyoverflow is a macro. */
+ yyoverflow (YY_("memory exhausted"),
+ &yyss1, yysize * sizeof (*yyssp),
+ &yyvs1, yysize * sizeof (*yyvsp),
+ &yystacksize);
+
+ yyss = yyss1;
+ yyvs = yyvs1;
+ }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+ goto yyexhaustedlab;
+# else
+ /* Extend the stack our own way. */
+ if (YYMAXDEPTH <= yystacksize)
+ goto yyexhaustedlab;
+ yystacksize *= 2;
+ if (YYMAXDEPTH < yystacksize)
+ yystacksize = YYMAXDEPTH;
+
+ {
+ yytype_int16 *yyss1 = yyss;
+ union yyalloc *yyptr =
+ (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+ if (! yyptr)
+ goto yyexhaustedlab;
+ YYSTACK_RELOCATE (yyss_alloc, yyss);
+ YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+# undef YYSTACK_RELOCATE
+ if (yyss1 != yyssa)
+ YYSTACK_FREE (yyss1);
+ }
+# endif
+#endif /* no yyoverflow */
+
+ yyssp = yyss + yysize - 1;
+ yyvsp = yyvs + yysize - 1;
+
+ YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+ (unsigned long int) yystacksize));
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ YYABORT;
+ }
+
+ YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+ if (yystate == YYFINAL)
+ YYACCEPT;
+
+ goto yybackup;
+
+/*-----------.
+| yybackup. |
+`-----------*/
+yybackup:
+
+ /* Do appropriate processing given the current state. Read a
+ lookahead token if we need one and don't already have one. */
+
+ /* First try to decide what to do without reference to lookahead token. */
+ yyn = yypact[yystate];
+ if (yypact_value_is_default (yyn))
+ goto yydefault;
+
+ /* Not known => get a lookahead token if don't already have one. */
+
+ /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
+ if (yychar == YYEMPTY)
+ {
+ YYDPRINTF ((stderr, "Reading a token: "));
+ yychar = yylex ();
+ }
+
+ if (yychar <= YYEOF)
+ {
+ yychar = yytoken = YYEOF;
+ YYDPRINTF ((stderr, "Now at end of input.\n"));
+ }
+ else
+ {
+ yytoken = YYTRANSLATE (yychar);
+ YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+ }
+
+ /* If the proper action on seeing token YYTOKEN is to reduce or to
+ detect an error, take that action. */
+ yyn += yytoken;
+ if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+ goto yydefault;
+ yyn = yytable[yyn];
+ if (yyn <= 0)
+ {
+ if (yytable_value_is_error (yyn))
+ goto yyerrlab;
+ yyn = -yyn;
+ goto yyreduce;
+ }
+
+ /* Count tokens shifted since error; after three, turn off error
+ status. */
+ if (yyerrstatus)
+ yyerrstatus--;
+
+ /* Shift the lookahead token. */
+ YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+ /* Discard the shifted token. */
+ yychar = YYEMPTY;
+
+ yystate = yyn;
+ YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+ *++yyvsp = yylval;
+ YY_IGNORE_MAYBE_UNINITIALIZED_END
+
+ goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state. |
+`-----------------------------------------------------------*/
+yydefault:
+ yyn = yydefact[yystate];
+ if (yyn == 0)
+ goto yyerrlab;
+ goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction. |
+`-----------------------------*/
+yyreduce:
+ /* yyn is the number of a rule to reduce with. */
+ yylen = yyr2[yyn];
+
+ /* If YYLEN is nonzero, implement the default value of the action:
+ '$$ = $1'.
+
+ Otherwise, the following line sets YYVAL to garbage.
+ This behavior is undocumented and Bison
+ users should not rely upon it. Assigning to YYVAL
+ unconditionally makes the parser a bit smaller, and it avoids a
+ GCC warning that YYVAL may be used uninitialized. */
+ yyval = yyvsp[1-yylen];
+
+
+ YY_REDUCE_PRINT (yyn);
+ switch (yyn)
+ {
+ case 2:
+#line 40 "as.y" /* yacc.c:1646 */
+ { print(pile); printf("addr = %d\n",addr);}
+#line 1310 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 3:
+#line 42 "as.y" /* yacc.c:1646 */
+ { printf("Sans Params\n"); }
+#line 1316 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 5:
+#line 44 "as.y" /* yacc.c:1646 */
+ { printf("Prametre : %s\n", (yyvsp[0].id)); }
+#line 1322 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 8:
+#line 48 "as.y" /* yacc.c:1646 */
+ { struct symbole_t symbole = {"Salut", 0x77b58af, INT, 1}; push(symbole, pile); }
+#line 1328 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 16:
+#line 60 "as.y" /* yacc.c:1646 */
+ { printf("If reconnu\n"); }
+#line 1334 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 17:
+#line 61 "as.y" /* yacc.c:1646 */
+ { printf("Else if reconnu\n"); }
+#line 1340 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 18:
+#line 62 "as.y" /* yacc.c:1646 */
+ { printf("Else reconnu\n"); }
+#line 1346 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 20:
+#line 64 "as.y" /* yacc.c:1646 */
+ { printf("While reconnu\n"); }
+#line 1352 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 25:
+#line 72 "as.y" /* yacc.c:1646 */
+ { printf("%s prend une valeur\n", (yyvsp[-3].id)); }
+#line 1358 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 26:
+#line 74 "as.y" /* yacc.c:1646 */
+ { printf("Nombre\n"); }
+#line 1364 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 27:
+#line 75 "as.y" /* yacc.c:1646 */
+ { printf("Nombre exp\n"); }
+#line 1370 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 28:
+#line 76 "as.y" /* yacc.c:1646 */
+ { printf("Id\n"); }
+#line 1376 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 29:
+#line 77 "as.y" /* yacc.c:1646 */
+ { printf("Mul\n"); }
+#line 1382 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 30:
+#line 78 "as.y" /* yacc.c:1646 */
+ { printf("Div\n"); }
+#line 1388 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 31:
+#line 79 "as.y" /* yacc.c:1646 */
+ { printf("Sub\n"); }
+#line 1394 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 32:
+#line 80 "as.y" /* yacc.c:1646 */
+ { printf("Add\n"); }
+#line 1400 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 33:
+#line 81 "as.y" /* yacc.c:1646 */
+ { printf("Invoc\n"); }
+#line 1406 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 34:
+#line 82 "as.y" /* yacc.c:1646 */
+ { printf("Parentheses\n"); }
+#line 1412 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 35:
+#line 83 "as.y" /* yacc.c:1646 */
+ { printf("Moins\n"); }
+#line 1418 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 36:
+#line 84 "as.y" /* yacc.c:1646 */
+ { printf("==\n"); }
+#line 1424 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 37:
+#line 85 "as.y" /* yacc.c:1646 */
+ { printf(">\n"); }
+#line 1430 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 38:
+#line 86 "as.y" /* yacc.c:1646 */
+ { printf("<\n"); }
+#line 1436 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 39:
+#line 87 "as.y" /* yacc.c:1646 */
+ { printf("!\n"); }
+#line 1442 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 40:
+#line 90 "as.y" /* yacc.c:1646 */
+ { printf("Declaration de %s\n", (yyvsp[-2].id)); }
+#line 1448 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 41:
+#line 91 "as.y" /* yacc.c:1646 */
+ { printf("Declaration de %s (CONSTANTE)\n", (yyvsp[-4].id)); }
+#line 1454 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 42:
+#line 92 "as.y" /* yacc.c:1646 */
+ { printf("Declaration de %s\n", (yyvsp[-1].id)); }
+#line 1460 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 44:
+#line 94 "as.y" /* yacc.c:1646 */
+ { printf("Declaration avec valeur\n"); }
+#line 1466 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 45:
+#line 95 "as.y" /* yacc.c:1646 */
+ { printf("Declaration sans valeur\n"); }
+#line 1472 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+ case 46:
+#line 97 "as.y" /* yacc.c:1646 */
+ { printf("Appel de printf sur %s\n", (yyvsp[-1].id)); }
+#line 1478 "as.tab.c" /* yacc.c:1646 */
+ break;
+
+
+#line 1482 "as.tab.c" /* yacc.c:1646 */
+ default: break;
+ }
+ /* User semantic actions sometimes alter yychar, and that requires
+ that yytoken be updated with the new translation. We take the
+ approach of translating immediately before every use of yytoken.
+ One alternative is translating here after every semantic action,
+ but that translation would be missed if the semantic action invokes
+ YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
+ if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
+ incorrect destructor might then be invoked immediately. In the
+ case of YYERROR or YYBACKUP, subsequent parser actions might lead
+ to an incorrect destructor call or verbose syntax error message
+ before the lookahead is translated. */
+ YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+ YYPOPSTACK (yylen);
+ yylen = 0;
+ YY_STACK_PRINT (yyss, yyssp);
+
+ *++yyvsp = yyval;
+
+ /* Now 'shift' the result of the reduction. Determine what state
+ that goes to, based on the state we popped back to and the rule
+ number reduced by. */
+
+ yyn = yyr1[yyn];
+
+ yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+ if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+ yystate = yytable[yystate];
+ else
+ yystate = yydefgoto[yyn - YYNTOKENS];
+
+ goto yynewstate;
+
+
+/*--------------------------------------.
+| yyerrlab -- here on detecting error. |
+`--------------------------------------*/
+yyerrlab:
+ /* Make sure we have latest lookahead translation. See comments at
+ user semantic actions for why this is necessary. */
+ yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
+
+ /* If not already recovering from an error, report this error. */
+ if (!yyerrstatus)
+ {
+ ++yynerrs;
+#if ! YYERROR_VERBOSE
+ yyerror (YY_("syntax error"));
+#else
+# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
+ yyssp, yytoken)
+ {
+ char const *yymsgp = YY_("syntax error");
+ int yysyntax_error_status;
+ yysyntax_error_status = YYSYNTAX_ERROR;
+ if (yysyntax_error_status == 0)
+ yymsgp = yymsg;
+ else if (yysyntax_error_status == 1)
+ {
+ if (yymsg != yymsgbuf)
+ YYSTACK_FREE (yymsg);
+ yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
+ if (!yymsg)
+ {
+ yymsg = yymsgbuf;
+ yymsg_alloc = sizeof yymsgbuf;
+ yysyntax_error_status = 2;
+ }
+ else
+ {
+ yysyntax_error_status = YYSYNTAX_ERROR;
+ yymsgp = yymsg;
+ }
+ }
+ yyerror (yymsgp);
+ if (yysyntax_error_status == 2)
+ goto yyexhaustedlab;
+ }
+# undef YYSYNTAX_ERROR
+#endif
+ }
+
+
+
+ if (yyerrstatus == 3)
+ {
+ /* If just tried and failed to reuse lookahead token after an
+ error, discard it. */
+
+ if (yychar <= YYEOF)
+ {
+ /* Return failure if at end of input. */
+ if (yychar == YYEOF)
+ YYABORT;
+ }
+ else
+ {
+ yydestruct ("Error: discarding",
+ yytoken, &yylval);
+ yychar = YYEMPTY;
+ }
+ }
+
+ /* Else will try to reuse lookahead token after shifting the error
+ token. */
+ goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR. |
+`---------------------------------------------------*/
+yyerrorlab:
+
+ /* Pacify compilers like GCC when the user code never invokes
+ YYERROR and the label yyerrorlab therefore never appears in user
+ code. */
+ if (/*CONSTCOND*/ 0)
+ goto yyerrorlab;
+
+ /* Do not reclaim the symbols of the rule whose action triggered
+ this YYERROR. */
+ YYPOPSTACK (yylen);
+ yylen = 0;
+ YY_STACK_PRINT (yyss, yyssp);
+ yystate = *yyssp;
+ goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR. |
+`-------------------------------------------------------------*/
+yyerrlab1:
+ yyerrstatus = 3; /* Each real token shifted decrements this. */
+
+ for (;;)
+ {
+ yyn = yypact[yystate];
+ if (!yypact_value_is_default (yyn))
+ {
+ yyn += YYTERROR;
+ if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+ {
+ yyn = yytable[yyn];
+ if (0 < yyn)
+ break;
+ }
+ }
+
+ /* Pop the current state because it cannot handle the error token. */
+ if (yyssp == yyss)
+ YYABORT;
+
+
+ yydestruct ("Error: popping",
+ yystos[yystate], yyvsp);
+ YYPOPSTACK (1);
+ yystate = *yyssp;
+ YY_STACK_PRINT (yyss, yyssp);
+ }
+
+ YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+ *++yyvsp = yylval;
+ YY_IGNORE_MAYBE_UNINITIALIZED_END
+
+
+ /* Shift the error token. */
+ YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+ yystate = yyn;
+ goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here. |
+`-------------------------------------*/
+yyacceptlab:
+ yyresult = 0;
+ goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here. |
+`-----------------------------------*/
+yyabortlab:
+ yyresult = 1;
+ goto yyreturn;
+
+#if !defined yyoverflow || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here. |
+`-------------------------------------------------*/
+yyexhaustedlab:
+ yyerror (YY_("memory exhausted"));
+ yyresult = 2;
+ /* Fall through. */
+#endif
+
+yyreturn:
+ if (yychar != YYEMPTY)
+ {
+ /* Make sure we have latest lookahead translation. See comments at
+ user semantic actions for why this is necessary. */
+ yytoken = YYTRANSLATE (yychar);
+ yydestruct ("Cleanup: discarding lookahead",
+ yytoken, &yylval);
+ }
+ /* Do not reclaim the symbols of the rule whose action triggered
+ this YYABORT or YYACCEPT. */
+ YYPOPSTACK (yylen);
+ YY_STACK_PRINT (yyss, yyssp);
+ while (yyssp != yyss)
+ {
+ yydestruct ("Cleanup: popping",
+ yystos[*yyssp], yyvsp);
+ YYPOPSTACK (1);
+ }
+#ifndef yyoverflow
+ if (yyss != yyssa)
+ YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+ if (yymsg != yymsgbuf)
+ YYSTACK_FREE (yymsg);
+#endif
+ return yyresult;
+}
+#line 111 "as.y" /* yacc.c:1906 */
+
+void main(void) {
+ init();
+ yyparse();
+}
diff --git a/Lex_Yacc/as.tab.h b/Lex_Yacc/as.tab.h
new file mode 100644
index 0000000..7635040
--- /dev/null
+++ b/Lex_Yacc/as.tab.h
@@ -0,0 +1,102 @@
+/* A Bison parser, made by GNU Bison 3.0.4. */
+
+/* Bison interface for Yacc-like parsers in C
+
+ Copyright (C) 1984, 1989-1990, 2000-2015 Free Software Foundation, Inc.
+
+ 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 3 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, see . */
+
+/* As a special exception, you may create a larger work that contains
+ part or all of the Bison parser skeleton and distribute that work
+ under terms of your choice, so long as that work isn't itself a
+ parser generator using the skeleton or a modified version thereof
+ as a parser skeleton. Alternatively, if you modify or redistribute
+ the parser skeleton itself, you may (at your option) remove this
+ special exception, which will cause the skeleton and the resulting
+ Bison output files to be licensed under the GNU General Public
+ License without this special exception.
+
+ This special exception was added by the Free Software Foundation in
+ version 2.2 of Bison. */
+
+#ifndef YY_YY_AS_TAB_H_INCLUDED
+# define YY_YY_AS_TAB_H_INCLUDED
+/* Debug traces. */
+#ifndef YYDEBUG
+# define YYDEBUG 1
+#endif
+#if YYDEBUG
+extern int yydebug;
+#endif
+
+/* Token type. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ enum yytokentype
+ {
+ tMAIN = 258,
+ tOBRACKET = 259,
+ tCBRACKET = 260,
+ tOBRACE = 261,
+ tCBRACE = 262,
+ tINT = 263,
+ tCONST = 264,
+ tPV = 265,
+ tCOMA = 266,
+ tMUL = 267,
+ tDIV = 268,
+ tADD = 269,
+ tSUB = 270,
+ tEQ = 271,
+ tNB = 272,
+ tNBEXP = 273,
+ tID = 274,
+ tPRINTF = 275,
+ tERROR = 276,
+ tIF = 277,
+ tWHILE = 278,
+ tELSE = 279,
+ tLT = 280,
+ tGT = 281,
+ tEQCOND = 282,
+ tAND = 283,
+ tOR = 284,
+ tNOT = 285
+ };
+#endif
+
+/* Value type. */
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+
+union YYSTYPE
+{
+#line 1 "as.y" /* yacc.c:1909 */
+
+ int nombre;
+ char id[30];
+
+#line 90 "as.tab.h" /* yacc.c:1909 */
+};
+
+typedef union YYSTYPE YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+extern YYSTYPE yylval;
+
+int yyparse (void);
+
+#endif /* !YY_YY_AS_TAB_H_INCLUDED */
diff --git a/Lex_Yacc/as.y b/Lex_Yacc/as.y
new file mode 100644
index 0000000..8d41803
--- /dev/null
+++ b/Lex_Yacc/as.y
@@ -0,0 +1,159 @@
+%union {
+ int nombre;
+ char id[30];
+}
+%{
+#include "../Symboles/table_symboles.h"
+#include
+#include
+#include
+
+int addr = 0;
+
+%}
+
+%token tMAIN
+%token tOBRACKET tCBRACKET
+%token tOBRACE tCBRACE
+%token tINT
+%token tCONST
+%token tPV tCOMA#include
+%token tMUL tDIV tADD tSUB tEQ
+%token tNB tNBEXP
+%token tID
+%token tPRINTF
+%token tERROR
+%token tIF tWHILE tELSE
+%token tLT tGT tEQCOND
+%token tAND tOR
+
+%left tAND tOR
+%left tNOT
+%left tLT tGT
+%left tEQCOND
+%left tADD tSUB
+%left tMUL tDIV
+
+
+
+//%type E
+
+/******************************************** FAIRE LA GENERATION DU CODE ASSEMBLEUR DANS UN TABLEAU AVEC UN FPRINTF *******************/
+
+%%
+
+Main : tINT tMAIN tOBRACE Params tCBRACE Body { print(pile); printf("addr = %d\n",addr);} ;
+
+Params : { printf("Sans Params\n"); } ;
+Params : Param SuiteParams ;
+Param : tINT tID { printf("Prametre : %s\n", $2); };
+SuiteParams : tCOMA Param SuiteParams ;
+SuiteParams : ;
+
+Body : tOBRACKET Instructions tCBRACKET { struct symbole_t symbole = {"Salut", 0x77b58af, INT, 1}; push(symbole, pile); } ;
+
+
+Instructions : Instruction Instructions ;
+Instructions : ;
+Instruction : Aff ;
+Instruction : Decl ;
+Instruction : Invocation tPV ;
+Instruction : If;
+Instruction : While;
+
+
+If : tIF tOBRACE Cond tCBRACE Body Else { printf("If reconnu\n"); };
+Else : tELSE If { printf("Else if reconnu\n"); };
+Else : tELSE Body { printf("Else reconnu\n"); };
+Else : ;
+While : tWHILE tOBRACE Cond tCBRACE Body { printf("While reconnu\n"); };
+
+Cond : E SuiteCond ;
+SuiteCond : ;
+SuiteCond : tAND E SuiteCond;
+SuiteCond : tOR E SuiteCond;
+
+
+Aff : tID tEQ E tPV { printf("%s prend une valeur\n", $1);} ; //besoin de get_address
+
+E : tNB { printf("Nombre\n");
+ struct symbole_t symbole = ("", addr, INT, 1};
+ push(symbole, pile);
+$$=addr;
+ addr++;
+ printf("AFC %d %d",addr,$1); } ;
+
+E : tNBEXP { printf("Nombre exp\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("AFC %d %d",addr,$1); };
+E : tID { printf("Id\n"); /*Faire un get_address sur la pile*/};
+E : E tMUL E { printf("Mul\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("MUL %d %d %d",addr, $1,$2);};
+E : E tDIV E { printf("Div\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("DIV %d %d %d",addr, $1,$2);};
+E : E tSUB E { printf("Sub\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("SOU %d %d %d",addr, $1,$2);};
+E : E tADD E { printf("Add\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("ADD %d %d %d",addr, $1,$2);}};
+E : Invocation { printf("Invoc\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("AFC %d %d",addr, $1);};
+E : tOBRACE E tCBRACE { printf("Parentheses\n"); $$=$2};
+E : tSUB E { printf("Moins\n"); printf("SUB %d 0 %d",addr,$2);};
+E : E tEQCOND E { printf("==\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("EQU %d %d %d",addr, $1,$3);};
+E : E tGT E { printf(">\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("SUP %d %d %d",addr, $1,$3);};
+E : E tLT E { printf("<\n"); struct symbole_t symbole = {"", addr, INT, 1}; push(symbole, pile); $$=addr; addr++; printf("SUP %d %d %d",addr, $1,$3);};
+E : tNOT E { printf("!\n"); };
+
+
+
+//Créer un champ isConst dans la table des symboles
+Decl : tCONST tINT tID SuiteDeclConst { int init = ($3 != -1);
+ if (init){
+ int val = *$2;
+ printf("AFC %ld %d",addr,val);
+ }
+struct symbole_t symbole = {$2, addr, INT, init};
+push(symbole, pile);
+addr++;} ;
+SuiteDeclConst : tCOMA tID SuiteDecl { $$=$3; int init = ($3 != -1);
+ if (init){
+ int val = *$2;
+ printf("AFC %ld %d",addr,val);
+ }
+struct symbole_t symbole = {$2, addr, INT, init}; push(symbole, pile); addr++;};
+SuiteDeclConst : tEQ E tPV { $$=$2; };
+SuiteDeclConst : tPV { $$=$2; };
+
+Decl : tINT tID SuiteDecl { int init = ($3 != -1);
+ if (init){
+ int val = *$2;
+ printf("AFC %ld %d",addr,val);
+ }
+ struct symbole_t symbole = {$2, addr, INT, init};
+push(symbole, pile);
+addr++;} ;
+SuiteDecl : tCOMA tID SuiteDecl
+ { $$=$3;
+ int init = ($3 != -1);
+ if (init){
+ int val = *$2;
+ printf("AFC %ld %d",addr,val);
+ }
+ struct symbole_t symbole = {$2, addr, INT, init};
+ push(symbole, pile);
+ addr++;};
+SuiteDecl : tEQ E tPV { $$=$2;};
+SuiteDecl : tPV { $$=$2; };
+
+Invocation : tPRINTF tOBRACE tID tCBRACE { printf("Appel de printf sur %s\n", $3); } ;
+
+/*S : E tPV
+ { printf("RES: %d\n", $1); }
+ S
+ | { printf("END\n"); }
+ ;
+
+E : E tADD E { $$ = $1 + $3; }
+ | E tSUB E { $$ = $1 - $3; }
+ | tOB E tCB { $$ = $2; }
+ | tNB { $$ = $1; }
+ ;*/
+
+%%
+void main(void) {
+ init();
+ yyparse();
+}
diff --git a/Lex_Yacc/comp.sh b/Lex_Yacc/comp.sh
new file mode 100755
index 0000000..b63a0e4
--- /dev/null
+++ b/Lex_Yacc/comp.sh
@@ -0,0 +1,5 @@
+bison -d -t as.y -v
+flex al.lex
+gcc *.c ../Symboles/table_symboles.c -ly
+cat ../Fichiers_Tests/progC | ./a.out
+
diff --git a/Lex_Yacc/lex.yy.c b/Lex_Yacc/lex.yy.c
new file mode 100644
index 0000000..f1f2fb5
--- /dev/null
+++ b/Lex_Yacc/lex.yy.c
@@ -0,0 +1,1929 @@
+
+#line 3 "lex.yy.c"
+
+#define YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 6
+#define YY_FLEX_SUBMINOR_VERSION 4
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include
+#include
+#include
+#include
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have . Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types.
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t;
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX (4294967295U)
+#endif
+
+#ifndef SIZE_MAX
+#define SIZE_MAX (~(size_t)0)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+/* begin standard C++ headers. */
+
+/* TODO: this is always defined, so inline it */
+#define yyconst const
+
+#if defined(__GNUC__) && __GNUC__ >= 3
+#define yynoreturn __attribute__((__noreturn__))
+#else
+#define yynoreturn
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an
+ * integer in range [0..255] for use as an array index.
+ */
+#define YY_SC_TO_UI(c) ((YY_CHAR) (c))
+
+/* Enter a start condition. This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN (yy_start) = 1 + 2 *
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state. The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START (((yy_start) - 1) / 2)
+#define YYSTATE YY_START
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE yyrestart( yyin )
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+extern int yyleng;
+
+extern FILE *yyin, *yyout;
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+ #define YY_LESS_LINENO(n)
+ #define YY_LINENO_REWIND_TO(ptr)
+
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+ do \
+ { \
+ /* Undo effects of setting up yytext. */ \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ *yy_cp = (yy_hold_char); \
+ YY_RESTORE_YY_MORE_OFFSET \
+ (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+ YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+ } \
+ while ( 0 )
+#define unput(c) yyunput( c, (yytext_ptr) )
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+ {
+ FILE *yy_input_file;
+
+ char *yy_ch_buf; /* input buffer */
+ char *yy_buf_pos; /* current position in input buffer */
+
+ /* Size of input buffer in bytes, not including room for EOB
+ * characters.
+ */
+ int yy_buf_size;
+
+ /* Number of characters read into yy_ch_buf, not including EOB
+ * characters.
+ */
+ int yy_n_chars;
+
+ /* Whether we "own" the buffer - i.e., we know we created it,
+ * and can realloc() it to grow it, and should free() it to
+ * delete it.
+ */
+ int yy_is_our_buffer;
+
+ /* Whether this is an "interactive" input source; if so, and
+ * if we're using stdio for input, then we want to use getc()
+ * instead of fread(), to make sure we stop fetching input after
+ * each newline.
+ */
+ int yy_is_interactive;
+
+ /* Whether we're considered to be at the beginning of a line.
+ * If so, '^' rules will be active on the next match, otherwise
+ * not.
+ */
+ int yy_at_bol;
+
+ int yy_bs_lineno; /**< The line count. */
+ int yy_bs_column; /**< The column count. */
+
+ /* Whether to try to fill the input buffer when we reach the
+ * end of it.
+ */
+ int yy_fill_buffer;
+
+ int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+ /* When an EOF's been seen but there's still some text to process
+ * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+ * shouldn't try reading from the input source any more. We might
+ * still have a bunch of tokens to match, though, because of
+ * possible backing-up.
+ *
+ * When we actually see the EOF, we change the status to "new"
+ * (via yyrestart()), so that the user can continue scanning by
+ * just pointing yyin at a new input file.
+ */
+#define YY_BUFFER_EOF_PENDING 2
+
+ };
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* Stack of input buffers. */
+static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
+static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
+static YY_BUFFER_STATE * yy_buffer_stack = NULL; /**< Stack as an array. */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
+ ? (yy_buffer_stack)[(yy_buffer_stack_top)] \
+ : NULL)
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
+
+/* yy_hold_char holds the character lost when yytext is formed. */
+static char yy_hold_char;
+static int yy_n_chars; /* number of characters read into yy_ch_buf */
+int yyleng;
+
+/* Points to current character in buffer. */
+static char *yy_c_buf_p = NULL;
+static int yy_init = 0; /* whether we need to initialize */
+static int yy_start = 0; /* start state number */
+
+/* Flag which is used to allow yywrap()'s to do buffer switches
+ * instead of setting up a fresh yyin. A bit of a hack ...
+ */
+static int yy_did_buffer_switch_on_eof;
+
+void yyrestart ( FILE *input_file );
+void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer );
+YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size );
+void yy_delete_buffer ( YY_BUFFER_STATE b );
+void yy_flush_buffer ( YY_BUFFER_STATE b );
+void yypush_buffer_state ( YY_BUFFER_STATE new_buffer );
+void yypop_buffer_state ( void );
+
+static void yyensure_buffer_stack ( void );
+static void yy_load_buffer_state ( void );
+static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file );
+#define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER )
+
+YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size );
+YY_BUFFER_STATE yy_scan_string ( const char *yy_str );
+YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len );
+
+void *yyalloc ( yy_size_t );
+void *yyrealloc ( void *, yy_size_t );
+void yyfree ( void * );
+
+#define yy_new_buffer yy_create_buffer
+#define yy_set_interactive(is_interactive) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){ \
+ yyensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer( yyin, YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+ }
+#define yy_set_bol(at_bol) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){\
+ yyensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer( yyin, YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+ }
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+typedef flex_uint8_t YY_CHAR;
+
+FILE *yyin = NULL, *yyout = NULL;
+
+typedef int yy_state_type;
+
+extern int yylineno;
+int yylineno = 1;
+
+extern char *yytext;
+#ifdef yytext_ptr
+#undef yytext_ptr
+#endif
+#define yytext_ptr yytext
+
+static yy_state_type yy_get_previous_state ( void );
+static yy_state_type yy_try_NUL_trans ( yy_state_type current_state );
+static int yy_get_next_buffer ( void );
+static void yynoreturn yy_fatal_error ( const char* msg );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+ (yytext_ptr) = yy_bp; \
+ yyleng = (int) (yy_cp - yy_bp); \
+ (yy_hold_char) = *yy_cp; \
+ *yy_cp = '\0'; \
+ (yy_c_buf_p) = yy_cp;
+#define YY_NUM_RULES 31
+#define YY_END_OF_BUFFER 32
+/* This struct is not used in this scanner,
+ but its presence is necessary. */
+struct yy_trans_info
+ {
+ flex_int32_t yy_verify;
+ flex_int32_t yy_nxt;
+ };
+static const flex_int16_t yy_accept[62] =
+ { 0,
+ 0, 0, 32, 30, 28, 25, 30, 4, 5, 21,
+ 19, 27, 20, 22, 17, 24, 11, 23, 12, 29,
+ 29, 29, 29, 29, 29, 29, 2, 30, 3, 0,
+ 14, 17, 0, 13, 29, 29, 29, 9, 29, 29,
+ 29, 29, 15, 26, 18, 29, 29, 7, 29, 29,
+ 29, 29, 16, 1, 29, 29, 6, 29, 10, 8,
+ 0
+ } ;
+
+static const YY_CHAR yy_ec[256] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 2,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 3, 1, 1, 1, 1, 1, 4, 1, 5,
+ 6, 7, 8, 9, 10, 1, 11, 12, 12, 12,
+ 12, 12, 12, 12, 12, 12, 12, 1, 13, 14,
+ 15, 16, 1, 1, 17, 17, 17, 17, 17, 17,
+ 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
+ 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
+ 1, 1, 1, 1, 18, 1, 19, 17, 20, 17,
+
+ 21, 22, 17, 23, 24, 17, 17, 25, 26, 27,
+ 28, 29, 17, 30, 31, 32, 17, 17, 33, 17,
+ 17, 17, 34, 35, 36, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1
+ } ;
+
+static const YY_CHAR yy_meta[37] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 2, 1, 1, 1, 1, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 1, 1, 1
+ } ;
+
+static const flex_int16_t yy_base[63] =
+ { 0,
+ 0, 0, 71, 72, 72, 67, 65, 72, 72, 72,
+ 72, 72, 72, 72, 25, 72, 72, 53, 72, 0,
+ 39, 41, 16, 46, 34, 40, 72, 27, 72, 58,
+ 72, 27, 48, 72, 0, 32, 27, 0, 25, 32,
+ 31, 30, 72, 72, 41, 21, 30, 0, 23, 22,
+ 22, 13, 0, 0, 12, 21, 0, 19, 0, 0,
+ 72, 38
+ } ;
+
+static const flex_int16_t yy_def[63] =
+ { 0,
+ 61, 1, 61, 61, 61, 61, 61, 61, 61, 61,
+ 61, 61, 61, 61, 61, 61, 61, 61, 61, 62,
+ 62, 62, 62, 62, 62, 62, 61, 61, 61, 61,
+ 61, 61, 61, 61, 62, 62, 62, 62, 62, 62,
+ 62, 62, 61, 61, 61, 62, 62, 62, 62, 62,
+ 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
+ 0, 61
+ } ;
+
+static const flex_int16_t yy_nxt[109] =
+ { 0,
+ 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 4, 20, 21,
+ 22, 20, 20, 23, 20, 24, 20, 20, 25, 20,
+ 20, 20, 26, 27, 28, 29, 32, 38, 32, 35,
+ 60, 59, 39, 58, 57, 33, 56, 33, 55, 54,
+ 53, 52, 45, 51, 50, 49, 48, 47, 46, 45,
+ 44, 43, 42, 41, 40, 37, 36, 34, 31, 30,
+ 61, 3, 61, 61, 61, 61, 61, 61, 61, 61,
+ 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
+ 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
+
+ 61, 61, 61, 61, 61, 61, 61, 61
+ } ;
+
+static const flex_int16_t yy_chk[109] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 15, 23, 32, 62,
+ 58, 56, 23, 55, 52, 15, 51, 32, 50, 49,
+ 47, 46, 45, 42, 41, 40, 39, 37, 36, 33,
+ 30, 28, 26, 25, 24, 22, 21, 18, 7, 6,
+ 3, 61, 61, 61, 61, 61, 61, 61, 61, 61,
+ 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
+ 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
+
+ 61, 61, 61, 61, 61, 61, 61, 61
+ } ;
+
+static yy_state_type yy_last_accepting_state;
+static char *yy_last_accepting_cpos;
+
+extern int yy_flex_debug;
+int yy_flex_debug = 0;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+char *yytext;
+#line 1 "al.lex"
+#line 2 "al.lex"
+#include "as.tab.h"
+int yywrap(void){return 1;}
+#line 487 "lex.yy.c"
+#line 488 "lex.yy.c"
+
+#define INITIAL 0
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+static int yy_init_globals ( void );
+
+/* Accessor methods to globals.
+ These are made visible to non-reentrant scanners for convenience. */
+
+int yylex_destroy ( void );
+
+int yyget_debug ( void );
+
+void yyset_debug ( int debug_flag );
+
+YY_EXTRA_TYPE yyget_extra ( void );
+
+void yyset_extra ( YY_EXTRA_TYPE user_defined );
+
+FILE *yyget_in ( void );
+
+void yyset_in ( FILE * _in_str );
+
+FILE *yyget_out ( void );
+
+void yyset_out ( FILE * _out_str );
+
+ int yyget_leng ( void );
+
+char *yyget_text ( void );
+
+int yyget_lineno ( void );
+
+void yyset_lineno ( int _line_number );
+
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int yywrap ( void );
+#else
+extern int yywrap ( void );
+#endif
+#endif
+
+#ifndef YY_NO_UNPUT
+
+ static void yyunput ( int c, char *buf_ptr );
+
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy ( char *, const char *, int );
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen ( const char * );
+#endif
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+static int yyinput ( void );
+#else
+static int input ( void );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+ { \
+ int c = '*'; \
+ int n; \
+ for ( n = 0; n < max_size && \
+ (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+ buf[n] = (char) c; \
+ if ( c == '\n' ) \
+ buf[n++] = (char) c; \
+ if ( c == EOF && ferror( yyin ) ) \
+ YY_FATAL_ERROR( "input in flex scanner failed" ); \
+ result = n; \
+ } \
+ else \
+ { \
+ errno=0; \
+ while ( (result = (int) fread(buf, 1, (yy_size_t) max_size, yyin)) == 0 && ferror(yyin)) \
+ { \
+ if( errno != EINTR) \
+ { \
+ YY_FATAL_ERROR( "input in flex scanner failed" ); \
+ break; \
+ } \
+ errno=0; \
+ clearerr(yyin); \
+ } \
+ }\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int yylex (void);
+
+#define YY_DECL int yylex (void)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK /*LINTED*/break;
+#endif
+
+#define YY_RULE_SETUP \
+ YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+ yy_state_type yy_current_state;
+ char *yy_cp, *yy_bp;
+ int yy_act;
+
+ if ( !(yy_init) )
+ {
+ (yy_init) = 1;
+
+#ifdef YY_USER_INIT
+ YY_USER_INIT;
+#endif
+
+ if ( ! (yy_start) )
+ (yy_start) = 1; /* first start state */
+
+ if ( ! yyin )
+ yyin = stdin;
+
+ if ( ! yyout )
+ yyout = stdout;
+
+ if ( ! YY_CURRENT_BUFFER ) {
+ yyensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ yy_create_buffer( yyin, YY_BUF_SIZE );
+ }
+
+ yy_load_buffer_state( );
+ }
+
+ {
+#line 6 "al.lex"
+
+
+#line 708 "lex.yy.c"
+
+ while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */
+ {
+ yy_cp = (yy_c_buf_p);
+
+ /* Support of yytext. */
+ *yy_cp = (yy_hold_char);
+
+ /* yy_bp points to the position in yy_ch_buf of the start of
+ * the current run.
+ */
+ yy_bp = yy_cp;
+
+ yy_current_state = (yy_start);
+yy_match:
+ do
+ {
+ YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ;
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 62 )
+ yy_c = yy_meta[yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
+ ++yy_cp;
+ }
+ while ( yy_base[yy_current_state] != 72 );
+
+yy_find_action:
+ yy_act = yy_accept[yy_current_state];
+ if ( yy_act == 0 )
+ { /* have to back up */
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
+ yy_act = yy_accept[yy_current_state];
+ }
+
+ YY_DO_BEFORE_ACTION;
+
+do_action: /* This label is used only to access EOF actions. */
+
+ switch ( yy_act )
+ { /* beginning of action switch */
+ case 0: /* must back up */
+ /* undo the effects of YY_DO_BEFORE_ACTION */
+ *yy_cp = (yy_hold_char);
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
+ goto yy_find_action;
+
+case 1:
+YY_RULE_SETUP
+#line 8 "al.lex"
+{ return tMAIN ;}
+ YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 9 "al.lex"
+{ return tOBRACKET;}
+ YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 10 "al.lex"
+{ return tCBRACKET; }
+ YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 11 "al.lex"
+{ return tOBRACE; }
+ YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 12 "al.lex"
+{ return tCBRACE; }
+ YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 13 "al.lex"
+{ return tCONST; }
+ YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 14 "al.lex"
+{ return tINT; }
+ YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 15 "al.lex"
+{ return tPRINTF; } //Degeu mais à degager
+ YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 16 "al.lex"
+{ return tIF; }
+ YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 17 "al.lex"
+{ return tWHILE; }
+ YY_BREAK
+case 11:
+YY_RULE_SETUP
+#line 18 "al.lex"
+{ return tLT; }
+ YY_BREAK
+case 12:
+YY_RULE_SETUP
+#line 19 "al.lex"
+{ return tGT; }
+ YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 20 "al.lex"
+{ return tEQCOND; }
+ YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 21 "al.lex"
+{ return tAND; }
+ YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 22 "al.lex"
+{ return tOR; }
+ YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 23 "al.lex"
+{ return tELSE;}
+ YY_BREAK
+case 17:
+YY_RULE_SETUP
+#line 26 "al.lex"
+{ yylval.nombre = atoi(yytext); return tNB; }
+ YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 27 "al.lex"
+{ yylval.nombre = -1; return tNBEXP; } //Renvoyer le token tNB et pas tNBEXP
+ YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 28 "al.lex"
+{ return tADD; }
+ YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 29 "al.lex"
+{ return tSUB; }
+ YY_BREAK
+case 21:
+YY_RULE_SETUP
+#line 30 "al.lex"
+{ return tMUL; }
+ YY_BREAK
+case 22:
+YY_RULE_SETUP
+#line 31 "al.lex"
+{ return tDIV; }
+ YY_BREAK
+case 23:
+YY_RULE_SETUP
+#line 32 "al.lex"
+{ return tEQ; }
+ YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 33 "al.lex"
+{ return tPV; }
+ YY_BREAK
+case 25:
+YY_RULE_SETUP
+#line 34 "al.lex"
+{} //Ne pas les retourner à Yacc
+ YY_BREAK
+case 26:
+YY_RULE_SETUP
+#line 35 "al.lex"
+{} //Ne pas les retourner à Yacc
+ YY_BREAK
+case 27:
+YY_RULE_SETUP
+#line 36 "al.lex"
+{ return tCOMA; }
+ YY_BREAK
+case 28:
+/* rule 28 can match eol */
+YY_RULE_SETUP
+#line 37 "al.lex"
+{} //Ne pas les retourner à Yacc
+ YY_BREAK
+case 29:
+YY_RULE_SETUP
+#line 38 "al.lex"
+{ strcpy(yylval.id, yytext); return tID; }
+ YY_BREAK
+case 30:
+YY_RULE_SETUP
+#line 39 "al.lex"
+{ return tERROR; }
+ YY_BREAK
+case 31:
+YY_RULE_SETUP
+#line 41 "al.lex"
+ECHO;
+ YY_BREAK
+#line 921 "lex.yy.c"
+case YY_STATE_EOF(INITIAL):
+ yyterminate();
+
+ case YY_END_OF_BUFFER:
+ {
+ /* Amount of text matched not including the EOB char. */
+ int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
+
+ /* Undo the effects of YY_DO_BEFORE_ACTION. */
+ *yy_cp = (yy_hold_char);
+ YY_RESTORE_YY_MORE_OFFSET
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+ {
+ /* We're scanning a new file or input source. It's
+ * possible that this happened because the user
+ * just pointed yyin at a new source and called
+ * yylex(). If so, then we have to assure
+ * consistency between YY_CURRENT_BUFFER and our
+ * globals. Here is the right place to do so, because
+ * this is the first action (other than possibly a
+ * back-up) that will match for the new input source.
+ */
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+ }
+
+ /* Note that here we test for yy_c_buf_p "<=" to the position
+ * of the first EOB in the buffer, since yy_c_buf_p will
+ * already have been incremented past the NUL character
+ * (since all states make transitions on EOB to the
+ * end-of-buffer state). Contrast this with the test
+ * in input().
+ */
+ if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
+ { /* This was really a NUL. */
+ yy_state_type yy_next_state;
+
+ (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
+
+ yy_current_state = yy_get_previous_state( );
+
+ /* Okay, we're now positioned to make the NUL
+ * transition. We couldn't have
+ * yy_get_previous_state() go ahead and do it
+ * for us because it doesn't know how to deal
+ * with the possibility of jamming (and we don't
+ * want to build jamming into it because then it
+ * will run more slowly).
+ */
+
+ yy_next_state = yy_try_NUL_trans( yy_current_state );
+
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+
+ if ( yy_next_state )
+ {
+ /* Consume the NUL. */
+ yy_cp = ++(yy_c_buf_p);
+ yy_current_state = yy_next_state;
+ goto yy_match;
+ }
+
+ else
+ {
+ yy_cp = (yy_c_buf_p);
+ goto yy_find_action;
+ }
+ }
+
+ else switch ( yy_get_next_buffer( ) )
+ {
+ case EOB_ACT_END_OF_FILE:
+ {
+ (yy_did_buffer_switch_on_eof) = 0;
+
+ if ( yywrap( ) )
+ {
+ /* Note: because we've taken care in
+ * yy_get_next_buffer() to have set up
+ * yytext, we can now set up
+ * yy_c_buf_p so that if some total
+ * hoser (like flex itself) wants to
+ * call the scanner after we return the
+ * YY_NULL, it'll still work - another
+ * YY_NULL will get returned.
+ */
+ (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
+
+ yy_act = YY_STATE_EOF(YY_START);
+ goto do_action;
+ }
+
+ else
+ {
+ if ( ! (yy_did_buffer_switch_on_eof) )
+ YY_NEW_FILE;
+ }
+ break;
+ }
+
+ case EOB_ACT_CONTINUE_SCAN:
+ (yy_c_buf_p) =
+ (yytext_ptr) + yy_amount_of_matched_text;
+
+ yy_current_state = yy_get_previous_state( );
+
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+ goto yy_match;
+
+ case EOB_ACT_LAST_MATCH:
+ (yy_c_buf_p) =
+ &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
+
+ yy_current_state = yy_get_previous_state( );
+
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+ goto yy_find_action;
+ }
+ break;
+ }
+
+ default:
+ YY_FATAL_ERROR(
+ "fatal flex scanner internal error--no action found" );
+ } /* end of action switch */
+ } /* end of scanning one token */
+ } /* end of user's declarations */
+} /* end of yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ * EOB_ACT_LAST_MATCH -
+ * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ * EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (void)
+{
+ char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+ char *source = (yytext_ptr);
+ int number_to_move, i;
+ int ret_val;
+
+ if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
+ YY_FATAL_ERROR(
+ "fatal flex scanner internal error--end of buffer missed" );
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+ { /* Don't try to fill the buffer, so this is an EOF. */
+ if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
+ {
+ /* We matched a single character, the EOB, so
+ * treat this as a final EOF.
+ */
+ return EOB_ACT_END_OF_FILE;
+ }
+
+ else
+ {
+ /* We matched some text prior to the EOB, first
+ * process it.
+ */
+ return EOB_ACT_LAST_MATCH;
+ }
+ }
+
+ /* Try to read more data. */
+
+ /* First move last chars to start of buffer. */
+ number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr) - 1);
+
+ for ( i = 0; i < number_to_move; ++i )
+ *(dest++) = *(source++);
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+ /* don't do the read, it's not guaranteed to return an EOF,
+ * just force an EOF
+ */
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
+
+ else
+ {
+ int num_to_read =
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+ while ( num_to_read <= 0 )
+ { /* Not enough room in the buffer - grow it. */
+
+ /* just a shorter name for the current buffer */
+ YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE;
+
+ int yy_c_buf_p_offset =
+ (int) ((yy_c_buf_p) - b->yy_ch_buf);
+
+ if ( b->yy_is_our_buffer )
+ {
+ int new_size = b->yy_buf_size * 2;
+
+ if ( new_size <= 0 )
+ b->yy_buf_size += b->yy_buf_size / 8;
+ else
+ b->yy_buf_size *= 2;
+
+ b->yy_ch_buf = (char *)
+ /* Include room in for 2 EOB chars. */
+ yyrealloc( (void *) b->yy_ch_buf,
+ (yy_size_t) (b->yy_buf_size + 2) );
+ }
+ else
+ /* Can't grow it, we don't own it. */
+ b->yy_ch_buf = NULL;
+
+ if ( ! b->yy_ch_buf )
+ YY_FATAL_ERROR(
+ "fatal error - scanner input buffer overflow" );
+
+ (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+ num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+ number_to_move - 1;
+
+ }
+
+ if ( num_to_read > YY_READ_BUF_SIZE )
+ num_to_read = YY_READ_BUF_SIZE;
+
+ /* Read in more data. */
+ YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+ (yy_n_chars), num_to_read );
+
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ if ( (yy_n_chars) == 0 )
+ {
+ if ( number_to_move == YY_MORE_ADJ )
+ {
+ ret_val = EOB_ACT_END_OF_FILE;
+ yyrestart( yyin );
+ }
+
+ else
+ {
+ ret_val = EOB_ACT_LAST_MATCH;
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+ YY_BUFFER_EOF_PENDING;
+ }
+ }
+
+ else
+ ret_val = EOB_ACT_CONTINUE_SCAN;
+
+ if (((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+ /* Extend the array by 50%, plus the number we really need. */
+ int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc(
+ (void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, (yy_size_t) new_size );
+ if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+ /* "- 2" to take care of EOB's */
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2);
+ }
+
+ (yy_n_chars) += number_to_move;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
+
+ (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+ return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+ static yy_state_type yy_get_previous_state (void)
+{
+ yy_state_type yy_current_state;
+ char *yy_cp;
+
+ yy_current_state = (yy_start);
+
+ for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
+ {
+ YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 62 )
+ yy_c = yy_meta[yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
+ }
+
+ return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ * next_state = yy_try_NUL_trans( current_state );
+ */
+ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
+{
+ int yy_is_jam;
+ char *yy_cp = (yy_c_buf_p);
+
+ YY_CHAR yy_c = 1;
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 62 )
+ yy_c = yy_meta[yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
+ yy_is_jam = (yy_current_state == 61);
+
+ return yy_is_jam ? 0 : yy_current_state;
+}
+
+#ifndef YY_NO_UNPUT
+
+ static void yyunput (int c, char * yy_bp )
+{
+ char *yy_cp;
+
+ yy_cp = (yy_c_buf_p);
+
+ /* undo effects of setting up yytext */
+ *yy_cp = (yy_hold_char);
+
+ if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
+ { /* need to shift things up to make room */
+ /* +2 for EOB chars. */
+ int number_to_move = (yy_n_chars) + 2;
+ char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
+ char *source =
+ &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
+
+ while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+ *--dest = *--source;
+
+ yy_cp += (int) (dest - source);
+ yy_bp += (int) (dest - source);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
+ (yy_n_chars) = (int) YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
+
+ if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
+ YY_FATAL_ERROR( "flex scanner push-back overflow" );
+ }
+
+ *--yy_cp = (char) c;
+
+ (yytext_ptr) = yy_bp;
+ (yy_hold_char) = *yy_cp;
+ (yy_c_buf_p) = yy_cp;
+}
+
+#endif
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+ static int yyinput (void)
+#else
+ static int input (void)
+#endif
+
+{
+ int c;
+
+ *(yy_c_buf_p) = (yy_hold_char);
+
+ if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
+ {
+ /* yy_c_buf_p now points to the character we want to return.
+ * If this occurs *before* the EOB characters, then it's a
+ * valid NUL; if not, then we've hit the end of the buffer.
+ */
+ if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
+ /* This was really a NUL. */
+ *(yy_c_buf_p) = '\0';
+
+ else
+ { /* need more input */
+ int offset = (int) ((yy_c_buf_p) - (yytext_ptr));
+ ++(yy_c_buf_p);
+
+ switch ( yy_get_next_buffer( ) )
+ {
+ case EOB_ACT_LAST_MATCH:
+ /* This happens because yy_g_n_b()
+ * sees that we've accumulated a
+ * token and flags that we need to
+ * try matching the token before
+ * proceeding. But for input(),
+ * there's no matching to consider.
+ * So convert the EOB_ACT_LAST_MATCH
+ * to EOB_ACT_END_OF_FILE.
+ */
+
+ /* Reset buffer status. */
+ yyrestart( yyin );
+
+ /*FALLTHROUGH*/
+
+ case EOB_ACT_END_OF_FILE:
+ {
+ if ( yywrap( ) )
+ return 0;
+
+ if ( ! (yy_did_buffer_switch_on_eof) )
+ YY_NEW_FILE;
+#ifdef __cplusplus
+ return yyinput();
+#else
+ return input();
+#endif
+ }
+
+ case EOB_ACT_CONTINUE_SCAN:
+ (yy_c_buf_p) = (yytext_ptr) + offset;
+ break;
+ }
+ }
+ }
+
+ c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
+ *(yy_c_buf_p) = '\0'; /* preserve yytext */
+ (yy_hold_char) = *++(yy_c_buf_p);
+
+ return c;
+}
+#endif /* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ *
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+ void yyrestart (FILE * input_file )
+{
+
+ if ( ! YY_CURRENT_BUFFER ){
+ yyensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ yy_create_buffer( yyin, YY_BUF_SIZE );
+ }
+
+ yy_init_buffer( YY_CURRENT_BUFFER, input_file );
+ yy_load_buffer_state( );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ *
+ */
+ void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
+{
+
+ /* TODO. We should be able to replace this entire function body
+ * with
+ * yypop_buffer_state();
+ * yypush_buffer_state(new_buffer);
+ */
+ yyensure_buffer_stack ();
+ if ( YY_CURRENT_BUFFER == new_buffer )
+ return;
+
+ if ( YY_CURRENT_BUFFER )
+ {
+ /* Flush out information for old buffer. */
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
+ yy_load_buffer_state( );
+
+ /* We don't actually know whether we did this switch during
+ * EOF (yywrap()) processing, but the only time this flag
+ * is looked at is after yywrap() is called, so it's safe
+ * to go ahead and always set it.
+ */
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+
+static void yy_load_buffer_state (void)
+{
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+ yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+ (yy_hold_char) = *(yy_c_buf_p);
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ *
+ * @return the allocated buffer state.
+ */
+ YY_BUFFER_STATE yy_create_buffer (FILE * file, int size )
+{
+ YY_BUFFER_STATE b;
+
+ b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) );
+ if ( ! b )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+ b->yy_buf_size = size;
+
+ /* yy_ch_buf has to be 2 characters longer than the size given because
+ * we need to put in 2 end-of-buffer characters.
+ */
+ b->yy_ch_buf = (char *) yyalloc( (yy_size_t) (b->yy_buf_size + 2) );
+ if ( ! b->yy_ch_buf )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+ b->yy_is_our_buffer = 1;
+
+ yy_init_buffer( b, file );
+
+ return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with yy_create_buffer()
+ *
+ */
+ void yy_delete_buffer (YY_BUFFER_STATE b )
+{
+
+ if ( ! b )
+ return;
+
+ if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+ YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+ if ( b->yy_is_our_buffer )
+ yyfree( (void *) b->yy_ch_buf );
+
+ yyfree( (void *) b );
+}
+
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a yyrestart() or at EOF.
+ */
+ static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
+
+{
+ int oerrno = errno;
+
+ yy_flush_buffer( b );
+
+ b->yy_input_file = file;
+ b->yy_fill_buffer = 1;
+
+ /* If b is the current buffer, then yy_init_buffer was _probably_
+ * called from yyrestart() or through yy_get_next_buffer.
+ * In that case, we don't want to reset the lineno or column.
+ */
+ if (b != YY_CURRENT_BUFFER){
+ b->yy_bs_lineno = 1;
+ b->yy_bs_column = 0;
+ }
+
+ b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+
+ errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ *
+ */
+ void yy_flush_buffer (YY_BUFFER_STATE b )
+{
+ if ( ! b )
+ return;
+
+ b->yy_n_chars = 0;
+
+ /* We always need two end-of-buffer characters. The first causes
+ * a transition to the end-of-buffer state. The second causes
+ * a jam in that state.
+ */
+ b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+ b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+ b->yy_buf_pos = &b->yy_ch_buf[0];
+
+ b->yy_at_bol = 1;
+ b->yy_buffer_status = YY_BUFFER_NEW;
+
+ if ( b == YY_CURRENT_BUFFER )
+ yy_load_buffer_state( );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ * the current state. This function will allocate the stack
+ * if necessary.
+ * @param new_buffer The new state.
+ *
+ */
+void yypush_buffer_state (YY_BUFFER_STATE new_buffer )
+{
+ if (new_buffer == NULL)
+ return;
+
+ yyensure_buffer_stack();
+
+ /* This block is copied from yy_switch_to_buffer. */
+ if ( YY_CURRENT_BUFFER )
+ {
+ /* Flush out information for old buffer. */
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ /* Only push if top exists. Otherwise, replace top. */
+ if (YY_CURRENT_BUFFER)
+ (yy_buffer_stack_top)++;
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+ /* copied from yy_switch_to_buffer. */
+ yy_load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ * The next element becomes the new top.
+ *
+ */
+void yypop_buffer_state (void)
+{
+ if (!YY_CURRENT_BUFFER)
+ return;
+
+ yy_delete_buffer(YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ if ((yy_buffer_stack_top) > 0)
+ --(yy_buffer_stack_top);
+
+ if (YY_CURRENT_BUFFER) {
+ yy_load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
+ }
+}
+
+/* Allocates the stack if it does not exist.
+ * Guarantees space for at least one push.
+ */
+static void yyensure_buffer_stack (void)
+{
+ yy_size_t num_to_alloc;
+
+ if (!(yy_buffer_stack)) {
+
+ /* First allocation is just for 2 elements, since we don't know if this
+ * scanner will even need a stack. We use 2 instead of 1 to avoid an
+ * immediate realloc on the next call.
+ */
+ num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */
+ (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
+ (num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
+ if ( ! (yy_buffer_stack) )
+ YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
+
+ memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+
+ (yy_buffer_stack_max) = num_to_alloc;
+ (yy_buffer_stack_top) = 0;
+ return;
+ }
+
+ if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
+
+ /* Increase the buffer to prepare for a possible push. */
+ yy_size_t grow_size = 8 /* arbitrary grow size */;
+
+ num_to_alloc = (yy_buffer_stack_max) + grow_size;
+ (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
+ ((yy_buffer_stack),
+ num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
+ if ( ! (yy_buffer_stack) )
+ YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
+
+ /* zero only the new slots.*/
+ memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
+ (yy_buffer_stack_max) = num_to_alloc;
+ }
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ *
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size )
+{
+ YY_BUFFER_STATE b;
+
+ if ( size < 2 ||
+ base[size-2] != YY_END_OF_BUFFER_CHAR ||
+ base[size-1] != YY_END_OF_BUFFER_CHAR )
+ /* They forgot to leave room for the EOB's. */
+ return NULL;
+
+ b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) );
+ if ( ! b )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
+
+ b->yy_buf_size = (int) (size - 2); /* "- 2" to take care of EOB's */
+ b->yy_buf_pos = b->yy_ch_buf = base;
+ b->yy_is_our_buffer = 0;
+ b->yy_input_file = NULL;
+ b->yy_n_chars = b->yy_buf_size;
+ b->yy_is_interactive = 0;
+ b->yy_at_bol = 1;
+ b->yy_fill_buffer = 0;
+ b->yy_buffer_status = YY_BUFFER_NEW;
+
+ yy_switch_to_buffer( b );
+
+ return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ *
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ * yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE yy_scan_string (const char * yystr )
+{
+
+ return yy_scan_bytes( yystr, (int) strlen(yystr) );
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ *
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE yy_scan_bytes (const char * yybytes, int _yybytes_len )
+{
+ YY_BUFFER_STATE b;
+ char *buf;
+ yy_size_t n;
+ int i;
+
+ /* Get memory for full buffer, including space for trailing EOB's. */
+ n = (yy_size_t) (_yybytes_len + 2);
+ buf = (char *) yyalloc( n );
+ if ( ! buf )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
+
+ for ( i = 0; i < _yybytes_len; ++i )
+ buf[i] = yybytes[i];
+
+ buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+ b = yy_scan_buffer( buf, n );
+ if ( ! b )
+ YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
+
+ /* It's okay to grow etc. this buffer, and we should throw it
+ * away when we're done.
+ */
+ b->yy_is_our_buffer = 1;
+
+ return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yynoreturn yy_fatal_error (const char* msg )
+{
+ fprintf( stderr, "%s\n", msg );
+ exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+ do \
+ { \
+ /* Undo effects of setting up yytext. */ \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ yytext[yyleng] = (yy_hold_char); \
+ (yy_c_buf_p) = yytext + yyless_macro_arg; \
+ (yy_hold_char) = *(yy_c_buf_p); \
+ *(yy_c_buf_p) = '\0'; \
+ yyleng = yyless_macro_arg; \
+ } \
+ while ( 0 )
+
+/* Accessor methods (get/set functions) to struct members. */
+
+/** Get the current line number.
+ *
+ */
+int yyget_lineno (void)
+{
+
+ return yylineno;
+}
+
+/** Get the input stream.
+ *
+ */
+FILE *yyget_in (void)
+{
+ return yyin;
+}
+
+/** Get the output stream.
+ *
+ */
+FILE *yyget_out (void)
+{
+ return yyout;
+}
+
+/** Get the length of the current token.
+ *
+ */
+int yyget_leng (void)
+{
+ return yyleng;
+}
+
+/** Get the current token.
+ *
+ */
+
+char *yyget_text (void)
+{
+ return yytext;
+}
+
+/** Set the current line number.
+ * @param _line_number line number
+ *
+ */
+void yyset_lineno (int _line_number )
+{
+
+ yylineno = _line_number;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param _in_str A readable stream.
+ *
+ * @see yy_switch_to_buffer
+ */
+void yyset_in (FILE * _in_str )
+{
+ yyin = _in_str ;
+}
+
+void yyset_out (FILE * _out_str )
+{
+ yyout = _out_str ;
+}
+
+int yyget_debug (void)
+{
+ return yy_flex_debug;
+}
+
+void yyset_debug (int _bdebug )
+{
+ yy_flex_debug = _bdebug ;
+}
+
+static int yy_init_globals (void)
+{
+ /* Initialization is the same as for the non-reentrant scanner.
+ * This function is called from yylex_destroy(), so don't allocate here.
+ */
+
+ (yy_buffer_stack) = NULL;
+ (yy_buffer_stack_top) = 0;
+ (yy_buffer_stack_max) = 0;
+ (yy_c_buf_p) = NULL;
+ (yy_init) = 0;
+ (yy_start) = 0;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+ yyin = stdin;
+ yyout = stdout;
+#else
+ yyin = NULL;
+ yyout = NULL;
+#endif
+
+ /* For future reference: Set errno on error, since we are called by
+ * yylex_init()
+ */
+ return 0;
+}
+
+/* yylex_destroy is for both reentrant and non-reentrant scanners. */
+int yylex_destroy (void)
+{
+
+ /* Pop the buffer stack, destroying each element. */
+ while(YY_CURRENT_BUFFER){
+ yy_delete_buffer( YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ yypop_buffer_state();
+ }
+
+ /* Destroy the stack itself. */
+ yyfree((yy_buffer_stack) );
+ (yy_buffer_stack) = NULL;
+
+ /* Reset the globals. This is important in a non-reentrant scanner so the next time
+ * yylex() is called, initialization will occur. */
+ yy_init_globals( );
+
+ return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, const char * s2, int n )
+{
+
+ int i;
+ for ( i = 0; i < n; ++i )
+ s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (const char * s )
+{
+ int n;
+ for ( n = 0; s[n]; ++n )
+ ;
+
+ return n;
+}
+#endif
+
+void *yyalloc (yy_size_t size )
+{
+ return malloc(size);
+}
+
+void *yyrealloc (void * ptr, yy_size_t size )
+{
+
+ /* The cast to (char *) in the following accommodates both
+ * implementations that use char* generic pointers, and those
+ * that use void* generic pointers. It works with the latter
+ * because both ANSI C and C++ allow castless assignment from
+ * any pointer type to void*, and deal with argument conversions
+ * as though doing an assignment.
+ */
+ return realloc(ptr, size);
+}
+
+void yyfree (void * ptr )
+{
+ free( (char *) ptr ); /* see yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 41 "al.lex"
+
+
+
+
diff --git a/Symboles/table_symboles.c b/Symboles/table_symboles.c
new file mode 100644
index 0000000..695381b
--- /dev/null
+++ b/Symboles/table_symboles.c
@@ -0,0 +1,118 @@
+/* TABLE DES SYMBOLE DU COMPILATEUR (PILE)
+
+-----------------------------------------------------
+| symbole | adresse | type | initialisé |
+-----------------------------------------------------
+| | | | |
+| | | | |
+| | | | |
+| i | 0x777756b8 | int | false |
+| size | 0x777756b8 | int | true |
+-----------------------------------------------------
+
+Types pour l'implémentation :
+ - enum type_t : [int]
+ - struct symbole : {
+ char nom[30];
+ uintptr_t adresse;
+ enum type_t type;
+ char initialized;
+ }
+
+Opérations possible :
+ - init -> pile * -> void
+ - push -> symbole -> pile * -> void
+ - pop -> pile * -> symbole
+ - exist -> pile * -> symbole -> char
+ - initialized -> pile * -> symbole -> char */
+
+#include "table_symboles.h"
+#include
+#include
+#include
+
+struct element_t {
+ struct symbole_t symbole;
+ struct element_t * suivant;
+};
+
+struct pile_t {
+ int taille;
+ struct element_t * first;
+};
+
+char * type_to_string(enum type_t type) {
+ if (type == INT) {
+ return "int";
+ } else {
+ return "unknown";
+ }
+}
+
+void print_symbole(struct symbole_t symbole) {
+ if (symbole.initialized) {
+ printf("\t\t{nom:%s, adresse:%p, type:%s, initialized:OUI}\n", symbole.nom, (void *)(symbole.adresse), type_to_string(symbole.type));
+ } else {
+ printf("\t\t{nom:%s, adresse:%p, type:%s, initialized:NON}\n", symbole.nom, (void *)(symbole.adresse), type_to_string(symbole.type));
+ }
+}
+
+void init (void) {
+ pile = malloc(sizeof(struct pile_t));
+ pile->first = NULL;
+ pile->taille = 0;
+}
+
+void push(struct symbole_t symbole, struct pile_t * pile) {
+ struct element_t * aux = malloc(sizeof(struct element_t));
+ aux->symbole = symbole;
+ aux->suivant = pile->first;
+ pile->first = aux;
+ pile->taille++;
+}
+
+struct symbole_t pop(struct pile_t * pile) {
+ struct symbole_t retour = {"", 0, UNKNOWN, 0};
+ struct element_t * aux;
+ if (pile->taille > 0) {
+ aux = pile->first;
+ pile->first = pile->first->suivant;
+ retour = aux->symbole;
+ free(aux);
+ pile->taille--;
+ }
+ return retour;
+}
+
+char status(char * nom, struct pile_t * pile) {
+ char retour = 0;
+ struct element_t * aux = pile->first;
+ int i;
+ for (i=0; i < pile->taille; i++) {
+ if (!strcmp(nom, aux->symbole.nom)) {
+ if (aux->symbole.initialized) {
+ retour = 1;
+ } else {
+ retour = 2;
+ }
+ break;
+ } else {
+ aux = aux->suivant;
+ }
+ }
+ return retour;
+}
+
+void print(struct pile_t * pile) {
+ printf("Affichage de la Table des Symboles\n\tSize : %d\n\tContenu : \n", pile->taille);
+ struct element_t * aux = pile->first;
+ int i;
+ for (i=0; i < pile->taille; i++) {
+ if (aux->symbole.initialized) {
+ printf("\t\t{nom:%s, adresse:%p, type:%s, initialized:OUI}\n", aux->symbole.nom, (void *)(aux->symbole.adresse), type_to_string(aux->symbole.type));
+ } else {
+ printf("\t\t{nom:%s, adresse:%p, type:%s, initialized:NON}\n", aux->symbole.nom, (void *)(aux->symbole.adresse), type_to_string(aux->symbole.type));
+ }
+ aux = aux->suivant;
+ }
+}
diff --git a/Symboles/table_symboles.h b/Symboles/table_symboles.h
new file mode 100644
index 0000000..d8fc90e
--- /dev/null
+++ b/Symboles/table_symboles.h
@@ -0,0 +1,48 @@
+/* TABLE DES SYMBOLE DU COMPILATEUR (PILE)
+
+-----------------------------------------------------
+| symbole | adresse | type | initialisé |
+-----------------------------------------------------
+| | | | |
+| | | | |
+| | | | |
+| i | 0x777756b8 | int | false |
+| size | 0x777756b8 | int | true |
+-----------------------------------------------------
+
+Types pour l'implémentation :
+ - enum type_t : [int]
+ - struct symbole : {
+ char nom[30];
+ uintptr_t adresse;
+ enum type_t type;
+ char initialized;
+ }
+
+Opérations possible :
+ - init -> pile * -> void
+ - push -> symbole -> pile * -> void
+ - pop -> pile * -> symbole
+ - status -> nom -> pile -> char */
+
+#include
+
+enum type_t {UNKNOWN, INT};
+
+struct symbole_t {
+ char nom[30];
+ uintptr_t adresse;
+ enum type_t type;
+ char initialized;
+};
+
+void print_symbole(struct symbole_t symbole);
+
+struct pile_t * pile;
+
+void init(void);
+void push(struct symbole_t symbole, struct pile_t * pile);
+struct symbole_t pop(struct pile_t * pile);
+// renvoi 0 si nom n'existe pas, 2 si nom existe sans etre initialisée, 1 sinon
+char status(char * nom, struct pile_t * pile);
+void print(struct pile_t * pile);
diff --git a/Symboles/table_symboles.o b/Symboles/table_symboles.o
new file mode 100644
index 0000000..093f0a3
Binary files /dev/null and b/Symboles/table_symboles.o differ
diff --git a/Symboles/test_table_symbole b/Symboles/test_table_symbole
new file mode 100755
index 0000000..7e9f452
Binary files /dev/null and b/Symboles/test_table_symbole differ
diff --git a/Symboles/test_table_symbole.c b/Symboles/test_table_symbole.c
new file mode 100644
index 0000000..2aaf766
--- /dev/null
+++ b/Symboles/test_table_symbole.c
@@ -0,0 +1,32 @@
+#include "table_symboles.h"
+#include
+
+int main() {
+ printf("Procedure de test de la Table des Symboles\n");
+ init();
+ printf("Affichage de la Table des Symboles (vide)\n");
+ print(pile);
+
+ printf("Test de la fonction push :\n");
+ struct symbole_t symbole = {"Salut", 0x77b58af, INT, 1};
+ push(symbole, pile);
+ printf("Affichage de la Table des Symboles (1 élément : Salut)\n");
+ print(pile);
+ struct symbole_t symbole2 = {"Coucou", 0x77b54af, UNKNOWN, 0};
+ push(symbole2, pile);
+ printf("Affichage de la Table des Symboles (2 élément : Salut, Coucou)\n");
+ print(pile);
+
+ printf("Test de la fonction status :\n\tStatus de Salut (1 expected) : %d\n\tStatus de Coucou (2 expected) : %d\n\tStatus de Truc (0 expected) : %d\n", (int)status("Salut",pile), (int)status("Coucou",pile), (int)status("Truc",pile));
+
+ printf("Test de la fonction pop :\n");
+ printf("Symbole expected Coucou\n\t");
+ print_symbole(pop(pile));
+ print(pile);
+ printf("Symbole expected Salut\n\t");
+ print_symbole(pop(pile));
+ print(pile);
+ printf("Symbole expected Aucun\n\t");
+ print_symbole(pop(pile));
+ print(pile);
+}
diff --git a/Symboles/test_table_symbole.o b/Symboles/test_table_symbole.o
new file mode 100644
index 0000000..48fae3a
Binary files /dev/null and b/Symboles/test_table_symbole.o differ