From dfdcf2feb47e4104a07587a6d0ae5e2914ac85eb Mon Sep 17 00:00:00 2001 From: Nahom Date: Sun, 9 May 2021 19:55:27 +0200 Subject: [PATCH] Interpreteur OK + ajout makefile --- .DS_Store | Bin 6148 -> 8196 bytes .idea/misc.xml | 5 + .idea/projet_systeme.iml | 2 +- Makefile | 12 + a.out | Bin 46944 -> 0 bytes analyse_syntaxique.output | 1954 ------------------------------- analyse_syntaxique.tab.c | 2017 -------------------------------- analyse_syntaxique.tab.h | 107 -- analyse_syntaxique.y | 20 +- gen_assembleur.c | 12 +- instructions.md | 70 ++ instructions.txt | 42 +- interpreter/.DS_Store | Bin 0 -> 6148 bytes interpreter/input.txt | 26 + interpreter/interpreter | Bin 0 -> 37492 bytes interpreter/makefile | 14 + interpreter/src/instructions.c | 196 ++++ interpreter/src/instructions.h | 38 + interpreter/src/interpreter.l | 53 + interpreter/src/interpreter.y | 97 ++ lex.yy.c | 1958 ------------------------------- script.sh | 13 +- table_symboles.c | 1 - table_symboles.h | 2 +- test_file | 16 + xilinx/.DS_Store | Bin 0 -> 6148 bytes 26 files changed, 579 insertions(+), 6076 deletions(-) delete mode 100755 a.out delete mode 100644 analyse_syntaxique.output delete mode 100644 analyse_syntaxique.tab.c delete mode 100644 analyse_syntaxique.tab.h create mode 100644 instructions.md create mode 100644 interpreter/.DS_Store create mode 100644 interpreter/input.txt create mode 100755 interpreter/interpreter create mode 100755 interpreter/makefile create mode 100755 interpreter/src/instructions.c create mode 100644 interpreter/src/instructions.h create mode 100755 interpreter/src/interpreter.l create mode 100755 interpreter/src/interpreter.y delete mode 100644 lex.yy.c create mode 100644 test_file create mode 100644 xilinx/.DS_Store diff --git a/.DS_Store b/.DS_Store index d4d7cab6e9b760014a4b97929ab1c682fbd131af..6bd4d1ebbbca52042536a31e79d1925a50fec639 100644 GIT binary patch literal 8196 zcmeHM-D(p-6h6~GH!ac#g{F6VBY06lOR5z_h_Susg&;=sLM7d8VjH^MjoFQ9jFH^< z4(c2DC_aI&;Jpu^-Zxrl0v3Tw zi2$DuE-KTirej6r(Sb&$0HAXimIZy}0aC`*w5sV?Q7HEDeX1%FT7RvUPj3?hd!NH`d*)%B|6;;H+NXyt}u5GI%q5J9_sK zZiOQBElA7i_gVW1y(!CmUGIiL6dtlTs-r`s!DB{l&LXM!#R z(&X>R@bw`POyK8$OY;}#5$)1F+JT*2%x9uAWh7!aU>CFLzzxc9%8c_$M@T#WHSlrx zbGS6H4t8AAg)_&344bu3 zdB6rTkWMpu$hOj}HFz&-xEPDf1POff0+(5}wi4(6yVJk_Utk36(kucN0Wr5z->CtI zUvCvzNI2JaQTI`~FyB~FDS}3(xkcx`+b delta 111 zcmZp1XfcprU|?W$DortDU=RQ@Ie-{Mvv5r;6q~50$jHAjU^g=(|7IQmeWuAQB3~xg xh&D_ti&)Ig!6C>DR0sqD+(5z=q-SH{cjn3bGM*q47?>cYfh=Iy9M3a{830dp659X( diff --git a/.idea/misc.xml b/.idea/misc.xml index bedf918..53624c9 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -5,6 +5,11 @@ diff --git a/.idea/projet_systeme.iml b/.idea/projet_systeme.iml index 771e54c..94d8d6f 100644 --- a/.idea/projet_systeme.iml +++ b/.idea/projet_systeme.iml @@ -1,2 +1,2 @@ - \ No newline at end of file + \ No newline at end of file diff --git a/Makefile b/Makefile index e69de29..b9fae54 100644 --- a/Makefile +++ b/Makefile @@ -0,0 +1,12 @@ +all : compiler + +compiler: analyse_lexicale.lex analyse_syntaxique.y table_symboles.c table_fonctions.c + bison -d -t analyse_syntaxique.y -v + flex analyse_lexicale.lex + gcc -w *.c -ly -o compiler + +run: compiler + ./compiler < test_file + +clean: + rm -f lex.yy.c compiler analyse_syntaxique.output analyse_syntaxique.tab.c analyse_syntaxique.tab.h \ No newline at end of file diff --git a/a.out b/a.out deleted file mode 100755 index b101a9a5790045e1675aa5615dd2d46b5df2e457..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 46944 zcmeIbdwdi{_BUKfXcBHoxCFyZMg#$ca1A6Nng9b64G=CtyxWnENUql@m0K^K+P?5;Y`_f(yl>FFfC>+}Ae&-=&w zG;~hY_nbO)s_N9GtGlPyIdf;l#>5DH#EFXp#gbDLlEsYXr#S$UB{D=8{5@L?5}gt6 zBr(O$QUqLew6bbV6Bv&JrF0pw3b50GET^fqkf_1D_DJi^3e{8yhXg1c*_wBYjDk93 zK-0slbp2(DuhWrvlrFGY;epK#8PN1J8>Xo)AC-;HMO;2Rohh{lp()AIk@u;$h{F4R zA){?*DeKczr<;#-Waoc-B(vZG&ab0-*~#^yDHm6aDJ@w(Y2ujDqS2)#<-Rqe*JMl@ zJ!xWEbw%2ES#Hu#va{#r%bcja*>uV8gE(QtPv6lgZr+xG#`KYE-~R58mGjS3emQ`6 z=inqAvRp9^u|6g_mari>=@>a^^T6W#g5=DvP36ACqHP<&Yd0L4ISW@c7PA+0N>XEzPHvSB1N_bo@V7g_Cv||I)d9Y{1Dx8ty>@@R13b5bdUz4?x?dm|KB^Jw zDf$V=7Kg<2_;eBDV{Q1ojAz+!f&N}d-FuR#_Er^E)(Fp<60az(sPvQzx4YU~P@z+1u2t%t0@g-U0hgNQSA|BVdW%VTmr2XqIh*xiPs~Fk#&(M z@K%%{X;n$Nw-`AUt|@RAmy{QjmR#=XGKZ1*Hg7<&WzHEa?hfI<)z5Vy`rq5 zoK?G(XuEsq@C}R~wc(o> zKW@YCV7%Fe-_3ZyhHq#5v<-iX@m3rD4CBId$OhHz{v6{8Hv9#~lWq7x##3$h%Zxj0 z_-l-hu;FhpKGuf6%Xo$j|B&%48~!QdE*l77H4Ij<;P8&Xn@jW(t3geA7 z+{O428$OTmqc%LB@#8jp8RN}1yp-{P4Zn`@(>DAD##?RpEsP6Z_iO*ZjqwB<{wv0l zZTN2(PqpC>Gw!hAk25~PhCjvlSR4K{;~6&m4~%Eo@ZF5NZ1`Tr^KAHj#+TUeLyRx8 z;V(13(uTjrc%==0lkqh+{21fwZTS0)Z?fSZF}}rypJaTS4G%KD-G+b3_+vKw8^(9q z@E;l9W5eTCs(#&Q!xI=kV#B*Le${;B<|qk7f%#Sc9Me3+}Msdc8@PkLOr$z1}3;x?a`mO~TK$$e+H|A!G6Q%S#g( zZ?)jG@(CYo56ROtq&^ZXIA79AR!QS!2O@2`IVi zEjTY3CBDgm(>0Plwpj2~4T5g7;QcK4b_?F$fB#xa^d{<`9lyw^N*4 zH+WRWZ=pE3Y_L(rZ=^W6YH+8FUr%xBs=@6tUPW*4d1(EH9`DR0GHn~2C6sa(beu^Vj7=LrZy}QJ zYA{{_b!E1?{GWRJ!BwuIC|sq-(ol18TGHT+QvcEy$x9+}r2i!eHl*Jo)r|ZR>0JkZ zjC1)J~Vc)z6l_(F1FAWw$fGJ0vcbU$B%kOM;)zuysOJ9`S zx>F8FwEBH#AQ3Q~XI$G{4SilBeW;HZFUn>1iLI+WbMCq>0A?-`q9q=IYy@0pEvo7* zm;VsTJ_*1cN*37nLn!1jp={0>WK{S=btd0CtQU`QOFzNFiE>R#U|};q+_`illQ>_*~g6x`{r;)P=-i|+}^K?UA3{urns)qD* zt8fj3AyC&CbAfD;gUtrjvgvGgHB5}PavJ&|OB6BYDAkEF`_g=E9u;~J>GyxFnjryI z2&{|5xFSydClso4o{oXqsm?P=o0p@hqFYA02OOtW_`0EHeu)}zQI#0ep$c8(QfPf< zHJ863{d&pg#&{ALfPJT8lV2!fejy#jSW7tELbi$Y9AT=FL#^nbbf<~p51XrE3 zAl8&AsQqNT*q@9LW$cP+bT#Dts11%e>dKT7NjK64lFQsG3&6!0dC28I>Us;kw=o7K zO{Mf3ULZ9|!_nS1SDb|;Z#^vaDm)qZs%~6Jis+2|^$tpHZk58&da$_@Jc!JxYaC47 zHRIpl`|C%LSltUmMAF7&%E44QH*_caBwtteUtIoI(T;%=|03NgZMa2rai#wHu`+u_ z>YAHfF-n?sOK(3IQLkD|tFMhx&y6b8Q#z$TL+O{qqMzL)Qx@Nw1S4fVpu7pK(q>ty zZ5o9g$zokYUNaKQyisk+nM`A{PkPW0c+g{V;8gY7kiLE)DozhgzgAi43Te0f>uygW zm;4M`;F9M+;bjP#Tgmel@eQL^`J_yQ$xpC;5Y<=A@0gpbpw^VeK$Bto=8n{Tyfy-Uie(`Xb@9 zAsGHw_rrLFh#K3To~_5W#uj4_t-<^N#hp#OZ*-;h!Om8h*R=Y#0lAN(CP zw2=S_vw=nu$X$8ZA=HQzlx<^tUWN2}MEcXW7>i{dF_!uhNt;H&xDB#0?}Hghw+%$x zlp^7(-#`-xReh#ZkW}AFWs8;>G^d^B5$n2r_iJjW;MYh|_ktW~yzzBUQ6R=NUWbKT z*lA>JL&}X*%7*k9YhlO3bQE>~B*KL)e^D3qdsP)bTxTh4^FJ}b8F%efLzuGEFNZG- zW;A5NIU0yU?NDfPnJL4F_%S5Sr`7df1v(^{oeVTJcm{*XmX;XpmvU-tx+L6=R=30` z)0!k*m zo^Csh-50i&*UZqm&+VlC}$=ShM?As-{+xO zJH;w{A3_A9X{gyW4nB>_KDbv&rLTtXVl9*VoI?bvGm*j=i6Dk^zu`b2I0|aP-+@Gd z`O{^1JB9y(J3XfH!yd>6AbSRZpn$B|qX29(#f`rhj%2g=UxtRyAra^)b7-Pel*4{X z^(rn3_G1*MY#y$J&|k4iM>vzR`D?ZekEU>u%<>jWOj&NA#2E51y)8g8I)XRI=nO<- zDO!Q3*<%R=&6M!~*`RFyk>^Mp-3j@;^*iVua3RFAWNJez8z-aRRBKs&R)fh_6 zP*QU<)G$kS*Whra=221;FV!56s8O|K5^spK_5^t5R{6J{O}MPk zjfVkC^_sdsmPv~;*@Y+~;I~p2Or=t-Azk&V$lWRXLvWO+1nj7Enf^1>Q`dp|ex&|9 zrT(cW5iaaNeV3o7UV2u;w7sQJ*@VhOR&z;xrw-IVflY^>VLfemK;@OBp7sL}{>Kvt zKMWUbuW~LW^|+Y3M2NtS9Z|FOrxoGA4lw(H+Rym?ap5vgDPttUBa@xQtT zVv9)sR$`eE0d#XR;3x@9kOs)K%7AyU*A!Lo=Wu-z!iWXKDAhfb>IYbca2i>1G9!|p zA#b~Bv_9q#{@CCxP-Gg_f8aUg8U%u?fbAuH`_Y)BA(yoEfwth4lyAed50E&}3o1<` zgObvWGKP{)mFn&z-Sv%@DjA&x$2Cz%0_DWfS^^aZP_AIS(z(|qMBw&Q;RcO#-_hG) z2HKY9n}d`r4(<{>ia`f!#NV^!I}r%(0|ucB$-L^x#QzoX$-FJZzfY$5;ZZVAI*KWQ zQxV{L349O%N(e}K6#&<_KRK8W?5ApfAQ`zXQQEQ-DFel@MJH&;TW=cIQwFiY?lQN3 z?&LC@LLk_RNe5+EL+QvrP2q@A&ikyJQ!O;%c z3UHGI)v(nhF|~&f!5b-8o&o=hL9~lXKY`L`se(2=f^aPi)@pPe5C3_pyDHVkS3upT zFb#E4N~(vnqxyA>S30}@!s>2HbuFpBMXByds+-ayYP8kY{XEs(mFgj+dW=%N`(cDj z+fm*3=c$G^s)VLus5^#y5WbRB_iRV?^O$~qMuni|Wc`xr8l_s0>fI9~YIKDx`+2J2 zcBHx|sXkk&e)u7TuWU!P@$*zCE7iL_Q1>F*6xm!tszp1hpMb~f3eoEU3?;O<>#5XK zkeavQby`dpxWbZDV^>lKGG;!-9d;@L$o=&Pq2m1s#5#vq)K^C#5TpxAR*QX%^=jrh z8=SzMV+3^WLRU5AU%Jqc+cvShZG&BigUzvWC)VhW6u21i*Y6>DV;ZuwVmgGm-g9ypuFr? z)^f6exV&!FSJvvX)!a&#tuDX1vbGlL+lzIf8vU}Yidh#J8s3fg2CF{WjYv9h6!lGZ z(w=e5QFVc@_K?Jy{0(w5iS{(s<=D28evd1Nq-Xo!5?d!P&OGEh*Cur-E(dtSX&W*L zp7~tYztx(T*cxn0NvSs=g(f}w33Q3pAHAbZqc?)#EuhYbsOH;&k&JicTe{0FAnXLu zj;q=U;>{AD!!#Z!;GXv@1mHaPqT%240nk)ry=Xi=iR#2^y`*xDJw(>z1ba`%ua_sI}F@gIMyk-FWjB)yejWQ5$h$ z&7#OA(mGVE^i#SC1B;C;uFB%N))?OfHs;^3%xv+6X@f8iReB)`)}IEl#|S+ zij(D|KHiTKaxvxYC_%l*G-3$Xef;DnS_OOLg{TL#?n5X)YE-n0p-n6mM{SCh!4!vE zRlyMDR@oSslmNU3#w-NG&P?kuW#>mop`AHuKU2Hj{-@dX1|gTgik~+Q znZ|=x%i6oD-3D5RlC@+P9`Yt#9mw%LG27imPkaH`v#FPwU$;nbP;8m6r$!C_;BPK`-GqqT#X~PlL|AUbB5Y9jGqf(kKcGf}@2l_`3csPkEfhYa!hfUi zZWaE3!cVC1I~4wn3cp6-+g12Q3g4u{&m-JYi;Q+tz>5G4z%ADzu!9225qOjWmm}~1 z1@aL1H3eoPa5n`mLg01^q$AKkfl&x-qQJQb+(d!?2-H)cCjuKOkO03n)*-~ViE)b< zw;5ZT)~`qL>EPO=d&jtIdYYJ~WKR1#M#3B7x-}yp&d`> z_h{Yl4dyIZdc^NLY`dFiIuAq9NxBi~cOIu0Zn2uqBdRR8nR{Fgi|=7HQ9b;&zmkXL zOCgt%{eFA zF>O}Zv@;*JG41jw)1H9^vJ`gHoIB|uOj~;o{?>t;rdl&L6`>9(?8%V+zKBgy9(mL#9Pk0f8f z@R_FPxT%vp9+k}L|5&Ab-kS1BO8JaEWkvfb->{~<4k=sKMrD}MezHfc$)->;r@8dR zOtb7bQgac1pu3ylBGTh<3!VO;)8CAurdreg`#lKO9Ztsbrp}3{4XBai;GXGhOxo;Hf{Xflo?Mnk1(yen~E*Cyi# zV_1{bB8Z2se2ECpr?B6+hKOlgYvBx6oF$5Lo#J>0LCPbcl(|F>eiBC)$e3fGaC~56 zsvtcBl*EOS^cW@uKaO)X4D7mJWI+PuI@6nIT%dp`uHi@qQ$y13lth`z*}RE*VKcyh zX%Oaj9;MYFu%z8sJ;9~XjSUB?m6lSQoNvOF!&hP@*x{puQfWZ%9en?R-<^u)qBr{!XyE)+1R|g1)5ap|86#okxAYvS#y4 zhiTrk7=XvBnq#cV)^ajjqvR#k{|nx+#mc5lJ~sYXUF|X98-)rDEL0V08t)^7y0fOZ z)RF>qg1O!}{t#7wA;2niQh`UKY9<%YY!iVM#a7?nEoSW0rwq zH0mHca5xZ=0|#1nEUTf`HD*u*t!^6W2*JqUP^>fdbb|8+4d~osQ0PBc@9gPJp|241DAYiq z-V~~%P#+4_P^d43Dkwzne+4}hqQ@tKS5oLK3eBfbDurfKs2_!xgDEtKLMaqFn?l_vG?+p$6zV~t?{K-ZhlbPO7YL#1Mm$JW*Ay80E-oyMe?Q<5 zdt!5|bHv#mdmvKxIia7)=lAn2~$_w4E-jAwq9w!!NNuv&8fw$rX_ajvMR|yn3fn>jhs0)Ks zUF`|s9RXl5>6DL<8JAKJ`;$b-&7CL6$20Ma8_+aHgJZG236Kw93&Pv0t~EAk;{&K* zj9i}JzY%CMk|0V);780&z%M}Z;rEkLBQTE|?MwWn+COyg^T9Dk-)gOE9Oic(3tkP) zxL*M#wh`*(wUBAtfGBy6vpX8`7HCCz-`^fp-a8-?__(tyFS6PwQ&3AAzlWd;r44%j zEemluvCNd|L@bR%b$bb6T!F+7YzZrzKrDG7U@X%L&qu9nY3YHr%nKNu0-h9H0tG*z zxw!6d#+8xT&IK#}Hdp5QIuT2*S$HG`jb<9%lu|Nyj}pDVji{OOIAOS8syh^;Jm5Y8 zG7nXEhY<;wKmyHu1WIRkm5!xRI?Swz@ZfP^dkFWF3*GTsghtB82x&X1tDLBVzr?k% z+(irCj1a^oh7&9gCy;#yE4N+L&MoK2p}1i>9{Q1&OIRzp5T1k1)oW97opTrFhh0;h zN7nuY>i#?jxtb~aiG*td9Sol28{1?MP6s5PRFZc_OQvi`+@Civcy64Os#j9w(NbBd z7dVedEB6IyD1^GJl%O+85EkS5(a0l^DurTb7+EWR=j#NRSq?Zc`WXdNV;a#ZFzJeQ zLnV@j=eQ-K!4(g;bsap|8b=+}8Sv+&;sTnP>akov4AeEsr-Q(i`Kc?%6nK%g!k?GW zf@i$JZ^}aNr4q0#+L4-kPCAm=>QO3niY@g}+T;5x48pqod`S-DuV|T!B>%dU@=f`KNH{|(pqYQf zRrsozf0#Tt=2eVSScsEr9ENKgp6c9Jdp45aPU-wjf%o6UEa7adt8EN^EjWAov){6Bq`OCMua|86QYR#Kef#3D4a(O#5*H_*F;}5Md!Gf9Dcq{s#b23x^Rk zo%>*j*`t|QX8J2c4t|D3=vOYYi_5$&!JGrDUvV{Dn5dqdmk(D4{`DuCCZ8n*#_#bL zO@0ZpHWLUpQw9%#;^>=rnPoKVe_RPa&h@(DX5lq1swh=kLiyJQ|r zy7g(KGgE?KK|JP=Y5Wzzw_0(d!HFx8W3+BHjr~$Vk4L2ftiEv(Yr+cjMYG2Pl9z5u z9@kz!-fj69&EWFSfSBb*Gk@MBZ8NZP)EuyzGjJXKX)rWc!gv2i#9bUkn!HXd3>f;-A z^^rA7Wn{~tgy8Vi$2XR%kK58%S*G(0U42BdN$)Vtl@WXJ zXa+rM3ij8Y0<(&ksHT^l-(a{og_crxQ@$RlGUtMy@*7u?B<;PR4iKb*N5p5aMR?WZ zR9)?8^~i0QF8PX^l#oy~b-&E@f969VW6+OEG6_%UQ0v zGBj~r*=gE%fQMrZ?K~|_zeOpiwkbe|hbOFV!m0$>pfTlaP8w+jZG%zeWGPJ}qcp)} zzcF5NjKNAEAzC1%58@bOq2b4wROpny6KS^^#Iv+q_KrjQs}Xsq0dkgP^@Bg7rVQCAHq2nKrKIdQrk z=#N#Lw=n1Ul-`z@2^5}{4kA5ks1oiGEsXU60scI=t`Va|KFb~t()obFyyqb6;vQ(3e&Wewzn zvKr(t!!?3&CLHAkmAwJCMYBe*i3nz>^u~u5p;%nfw?P7pNn3phf$y*xVy$2~ z0I+eNLuH@|S)dVbVztz*uUBddqtxndT?Q20`f3o_t>-A=NzuY)ijx4Ya%ffAKK4!}#5@T@3d-6h~JkD|h%bCMDp zY!TC)!stpMm*~d}sYC&6a~R)H&@{d$!j*AaLMiVNiLQ*m*|K;o;BfKON>z^Wrtz#& z;;V8sVPPvv0e3stjF-oo0v~h|Xd2@VsodDiqBH;{p9ha<#@vBU(2CXVOGrsJt%S^e z8AkHBMk*ore#1p+n~Zc2I)YE)55&h2EN?#=XHziqP}0p?h=n(m(cvMIl1Mn+te49; zbc(3_TBm}mW-^yD_A^3E<0B$`8CEz9#!gVip0*hKycF%Rg9uHkF-O9tyAFg+ZvZ!E;ek^RisTo;J-OCROIT}|40B)1O$4rru$YISMv!H_C)$5Th#o?Q>xQF6?CuhG)aJWjFFN9gx8* z_6_O#kOl>ktr~ElIu1}B1l~Z1e%Zh@&SW_Bg%S3nk&ru{X$%QRFrMCGVO$rE;4vYZ zEsUq3M6U~Iwou*ay>`*pBB*J+9L`;<+7)4=EAB;%4g`N23Eme8KF+}=uC{F{v0S#JL>VoflgXI z|7Wt)d6Gz2Cw2NdF#k#@{B5x+<7X(Z!uIabydYS1r9uKe@p_4jMLKlWYtS& z-`iG*yG7RC$g>XITutk@VJM@aRkvf^sb%OOd!TryKYxdR&SSR6Mv&W1SA(;W-E|;z zn$E}M9g-dLYM5?^lTx{ttRr}+W)Jn6_MXd*If(K#Lhq6A!;ZN8!_!6jNnWs<5q8je zC3^&7oP+9Ed;D7{yDd~nc%(@E90H!1`}#RcW#v(s+LQ!aN%E!x6lOWp1~)<@u%|6E z$r_41IeAwWvx>91N#x93BwEe_663?eU@+0@uNyHdf|Zty~5x?e&dcXz2+R_=T2aNm9;|Bz>SH)6NBv9uw#VP1vuN^XS#6 z@5gAn^(U$vgA%<5Of89;H}xC9bmdLIhLY_7ui4B-Z3I+%HwB)Cd)6Tf)Xrn7ku#n9 z*51*kP^%s?ce$o%4N5YMt|Y${WwI zQHy6fzhApcKHbK7g?*ZyavO)NAd9E+mLW!mipie}LM-C%D5&~%6D%@Fu4NMS7gck3 zZXHuQ{Q`v5GTF~Qc~)E2+ET1G-pDe_4I3_NpI3%P9=Id5y4*jZ)(ortz9oqYj0ZBu z-Edg8akx&GMR(Dee&<7NoI9$U`gY4D13C`bCwuE-Xjs!3>9bTZ*vo_2d(15)B}4Lw z!OTNzyUL2@dyY^IDINiK!znQ4#mlG6TS`?bl|J0(Bjx??I=kEgAP=0+-JSG>yE{c> zeb^t94gJyLcO7+k^$;Ygpo5a~1Cv}3YCp^1_5Zpcq)#orFm6$#-GWSt6oj2xH5@MC zmbc7<;jJo8OKv<#*~VGrLvN$_S-ADovUn3=cqAP^ROi?2%~(UowZ9XP!%hj8OcR1Fq7fKykuw!AQkyrD@}^D z38KSTg<6ty+@$0Zx=CeuJM`pQ><-Wb@_*bzBiW#pT2P|sN4gh2WAWAS5QJf-840l% zm1E2mxIDt<0fvC^gS)Pf{DP*kFlx3w7>oZB$A??FD>n+*V$*^UBg!Ve= z7p5KF8f?lNn4xf*=UnDsCLHv-?2?f+Mfo`c8q)05;Ezi(#_ zJ_0aYV>Gn3or8PygbGZ>$sm}DQzS|0D@l4ENv53xBD+rDW+;RWm?M>6QdJ{D{_l70 zYjW;{SJQLpa+2QJw)Y-%>0jyiiP_o2*hnt#$CTMXa!rAFIX~~j^~cVs&OK{?8_5>k zGil>*kZW#3kKd%qqTCIFqHK{Q#V<+vjgm}T46=ue4D8!U>$`o}tw1enlXv~knY`!+ zT2k!7EVpai4fnTMNsLDJue=!fIXP?u)9)0fdqz1#U@VvjUyiVP!{K58;~KG7oPeKw z+er3{?8~wj=lK6ZkKX1s47=z&`BQeIi7w3c|B&PVHh1KwQs==R;sW3O4hrkP@H)nQ zpws92|DEgqcBcOy*`YosTy-zTxH3QVeNI_ixs;yj%)UC?{o=|9>Abv2mS@&hZIdx_0Z{BQYttXRqFUQu>~i+OPkBfrHK->^Nr#u4I4e zShz5M@#U9aam7_j-OH92c~-2vwyeDJx~gigZ*|S}Yin;M1W0>bLQS z`pSzu_(^?Fk?=a_F3NE((A2pkPk6Iu&J^B-`O}4WPJXWN&dgaXym|9*&H@iK8`QaA z!91kO&dYNySeQK*3GyJdIA_7^{9GrA%yQ0Hl)Wft-dxDe&X#IsAzkhw;hil{NaZfV zpE=n%kfDnZZ{7k)7C0B>F90SpAk{gPVeUc*U*^go^>WBYcG)liE^UUA3Z`{;14lERVjJAQpJM zzN+${axNjh4t*a=5{E*ELSKiz!e9NbJH9!AJ9DA4@hiW>MPD%%G82Fhe}Wi~*l?T! z@E&!Rm?>t7G00}R#4nQC4uuv-x)6T{iQbG2!WV}wL--1jFLB~s0xVY)i$y?si{+vO z(u2fQaWUd#1qSO*r$RHq9VuQF|tVM|QQV#U*ETq0shBtt3 z{kNVa4}~_!P#w}z$>`sBu~F1>_)w@^{7a&Q-z3p+t#%QySj2TTVmieO(XCq|zSbeI z!t35c^y%C)0pD1X2c}T;dXbte970?;_)>tq&mGiXU?*3gen+Dg#9aQ8$f&WhHigI` zCLQC%JTZUhLNRE-u(T29kGx<(_VgJuXE|N7#k5>8XUM?uVt${C@+R~VV&cW=SyRNM z$y57?j7&;OWw|9>jzgiFMJ-~h#0}zoS)vh$&6fP5A;Ti4Y9aFX#n7ixzQ0J3Qly&> zyd8?)Y3_tyWHRupRGm@!UTD8mF%U%?E=Gv?Vx+hb=ASQI;sWHlNi>LGiaW$su}$17 zMxop{iOu46ly#Q46u-M$B5o9ELYgl1j}}wVZQ{jU;&O2X{A7-pB(B1&Ga4SVKy(oc z#bmT}H<2I`;W0z-ZHz3DEmpu6m&g z3oo86&Vttu7X4A-b@2EBz%FAwnx?};u0bQ7BPPHzCnCoc_`U0)Vpto=3~{BXfFDo8 z?~%-fALof%!!jR*7NG=-QI=BBUkQ&`Dy|l8u}l=82b2q+SO>gN6opf)7nR}g74Xar z;!fcgUBzu;i?|2=G6??KN0hJkMn!gA# zS!l88C`BspIHc}}HjGD0bdfXxSR#kxL3J%8B4?|`Wa$vpLo)uxgBOo-4MCnm;1#4V zAx!&0OA>PFFKHL#xIxxtTgd^?lLQS(@R{zgG8ulNweGcU=^>^?bpVrJ%$%ptTS=;~5yfq{d%x-u`#O-kxHDJiLICXOWf zL&wyvU6bczPVDB)y|CMyakHk4>)!pM*%uGa>NX{NT=(hH!lA>?J8#5r3K!uO{u(a+C>*n$)28-l{M2jYxWFR__!qJ(o1va%$Yk+ z7hO_(TrL(Z7>~cPu~^NBPO&0}j@VB4LQQO}=oHh*h>3~A5gQYSI2}FcqhB)EjTm&` z4FLRh2i_Vm;=C2t;`>46_{vV17*_4T{}Ey#eSpYOUa?v@h801>0#A{zu%vv2Lw=da zvAo7n zQKPi3VyQ;UCB@Q&#RXL*^x+^!xn~7FinK~DFFfVml`lSqdEQr91Q6P< z@!_*Yqc3s{9qO1Ss%y%<1#28?Stc(lr#OmAstXIM$P&RwWkqErMe!k}imDoiXU)n2 zA3j%9Bxc~NOXa>wYZ^ysMa8uRE9pB*VXjUu3Z4#yw&Fa9^E;dqacMCFXX8F~ECg2+@vCue#_60d=HkQx7VB49 zxz5H(OXY?0@&&DtX|X(GUY^LFHA7$tD=xu$`I0$^V+o6;EUi;rtFKCg4yPoV{=kz_|{XiSurp58`|p=kqv+ zf;SrHB%BxHbm5$j^9r1$I16zOE9!y{*i|Shoj)9G6AJ?<48pc(S4^lSmep~Zca2v> zlwCQjXlXbfipbtYi-?MtB z_UqkSUUK%PYtG*1A{Ay168Zo3P;-g40h0}C!hQg2zwW~5Jj~qmZyMG%Dy0ARLwqXM zkhG#4g_UJbtlNfTy)+8=*(^(&vlBTy46QA|83v!BcFu!jKTujp^+)^nhab?<6aT19 zQ{W-$$ir&4y~7D#b9VS|R+uvjD`4xtNE(HzxK)C}&ZsnYt~D+o+uqSh_6S3+(z?iA z(jEOF5#>ro8EG|7>ngRfBASX5S2Ot6A9X@BMXt2Y#)@hP*7>v!#DIp?{&dt~HqI=p z%r8RQT*xgk4y(|~So@}<*6CVu9M;-n&^Dt{*CSDj!*T5}4E@Rhi{rxe6RD5?{ZM=5 zk3swVPyI_q?F>PSWTVWfD04DOJp|>>43}7ySC{qzS>B=Ww}H~X`eCH#i~8=3dQU)$ z{Lhx2+P}EKTTtpKF7>Q&U~N%e?y16J2J0VuR8g%xMvpG9a1_Y>4M%YWwuglH^l&KD z?WIsC1?OO#BXLf^ISuD*obz#BiL=iu>hvI7fwKl@9nJ=vcjLSt=aV@9i1Pr>S8%?A z^Fy3}$N3e`|KKz*ZYSaFhx1&VqjBcqT!wQ!&fPe7;H1|4FUrGfw&lKJd=S!6R#J_{ zAE%S6Eyrj}RbXA`V9APAo~q(ftVrc*57iW1ZSEr7#${**pizu>_xq zUA&cQA@9g8Dys5SSM!FJLvF3isHhHz24inKJm8Gya>0dZ65OG32L+jw^KvUHZJ0mEKCM5l zPYelA`V%+@{|eU_pkaROnsEB>0j~wW6*oM?{J3xW>GbsL2#av7dUaHKRRGd|A^5k0 zpB|O}*l_+=0e=+Nwxm9+f04{yl^^`=;FnqXu`9#&-3R^`;LBZ7T|RFl{XXzJ<9hkF zsPwml)1Ls}2mZZL{JX;Z@4-I}{u5FBhr|4V7>};Ub@$#V{vX5q3&HR6YzRB{IJAAS ztHS)Nz^?$mAc}vLF&gy}))O}(+@7Pr zUyp0fAHWXtV_U=J%>{qykx=N}sPu1z)0cwZ`&IPoDE`Hg?|{n9;7@)H*Y#HYC`YVn z5?L2JA#(^a-&kd0zYN=O6#T6iqs=J(O=13N@CC;1yQ28N4D*vQ2dn~ra}@vPFn=ug zpU~JJ#Xk_{=Yf9{=7e8I@wbKfmEgy{i8i;^L2M|@-va*M!T%^K{rh45PVgVWTr$49|`4s#Io?MNGa7fyc~{H>Uq&bRVCk}c~u8FSfh!GGJzkNuMrpzFY~;Lpcg zhWGR%`Vl1m$p!Bk@GuNVc(WtAOTk|ZK6Xtbd{>0O8T=VP!QTP?*q_kcV%o4_xy<{zuZ z3##88;3vTT$D{ZUNdt-hI{3c?zrU5AAF=-w_$K(nto&sWes`=RXq`g)1YzG<9N~`w zpVD_Up67zU5&UD;^s#S-?JEU8<5(#4NEHA6Fn=@n`@#Qn6#rw}wSU3&TvYnQ;qT@^!~L?hw|O_eSyWl6+d{i~`?<_23B7KQl48Ffl={eP#k* z2HZpV^u*-bVy7pj-WumjbTo9Do;YH&;Yu8PQ)gFVMqT`z#H^~sjO@g**@+{jCpsVp z`RUM;jHH{PXA|_$bohUd|62q9Cu<;C4)VCpOHsK@ELJp=>BUShVY-0nQl`t9u3%cq z^g56c8u zX4=X$#I*AYRUh4$CNoWC+MnrArX!h-W;%)K6s9hw^O)u{UBeis{o#|G-p#M}9BI_cJ}jRDTElHIBc@RDaj~eU9tzw(IY-2O0m8 zss8Tzj~tI%sp?UGM_qq6U4JKCe-~Xz(Q}6C&{VD^0F97~26@L>3V4f@oScgh%)7-Q z0XcUggrQy@axH++66Vu9K!@hzheawVzKsW6ERp0fqO+n*#1ZDxB|9C(Y@oa*L0sSW z;qD}5=npNo={SC?LsC7qZ{mQy{*ISi>@zUkP7?wSji<7~+U`vpz?2~moj*T^6fWO? zutiG(FjuDdk>m8qBs%cum*&g(X^!8@{C{zLq2&J0{|Rh%w5xP6w|6nqRZMSUdKc42 znC@o!GShdNe#Z1$rk%OM`!YR`=_IDJm@Z~o%ybpgo0#6k^bw}JnZC^QU8bKg{g!FF zh5Z>|!WLCuaQ}(MI}6>2WR^PZ7&_{ENo>iuU?n97Z8MUPa4elwtpi#`_6JySN^G zBhuuzoy1pszdnM~I3J7p%(B&IBIE0A_&JR0^^4Xt8G#tww{%(h3Grr0ylwr^-W%ns z*Fz*rM-9%HcItT>@b>Kgy_8QD+qr$urGnyk0cQ+W_s#O+0Q-p&#lEJ*BkiK+gFmr+ z)=DLq!FrA{zP?1^_bDPiWZZF$0+ulTDdX#H_&*qLW_$|k|Bi8oytouXEKdf?JKQO+YaYW@o-wz=D z8yUxTlssN#e3MPjpBdj`lmC$MJ8k%9jBm5y^uQjqi=$fQx0&O%;{C*ZHv8u>zMXO1F2%sful}%5 z>5=<_2-4m%;Roj`+*CyTlJO5_D?sk`BKRod2{{V?f#vDv6G=~fwgTk-F@mo#{^4SU zr?dR~j2o9IK<))2_zB}5T&i%n2aF)?OOyWcJcS=tM9_~d6aMsN3MgPa9t+C${JCET zI5lT`^5;W72J_3An_01iv?re-7qY$E%r7}oPuqE90n6LxDf-E3daA}g->s2)+Ri(- z0;eak-k75d{D$p(fbmKmZ&6+H_ygmES^jCp_eq>17V<_1_}^I1->+1{x_#*$Yftpw zMw@?r&+@-uc^*bZcXV*F9}l(5;}On#fW$dsA(e z_yoq^1y1%Hw$^Wky zXM&VZ6kktLiubbqOFGcAl=U>To{bl&1ci)`Wn9<)D&X|=P#?xwy{MJ?6UEU&g^XZE zJ>vtfQou8eZ)N-#&v)`3CV0OFPUXt8<@xTN{n})F z4c7xNv&6lOKgZ?OE9nOrZ)JP{m+J|}=d=Faj6W-Jj#$X6EdMDl+`ebtdmYGs$>ZL7 z_LEZHcxYukqqv~QSdW2rAwRc|C%rmouk(OYyDzc%?IsW*yU_BW&J+F2k{~_r|P3!AQ?YE~`&ztj=Zh5~I!OPI0sGd(9cSweo zr`;jKPup;MSfjoEH9+EtVt9tqU!aIMkMT!%zWX!dQyKq+`=efe<}xmdl%R*@uaY=N zETpmn{3h0OK2JFEnGB@6lku~89=VNmJ<0ex3l#7X<1^vs$*6~;A3GRPgg%c<^>c)A zU2iWje#TaB-MIes{=fyS?QPE2#q-M(j0Yvo5exYdIN4*LFS?@t(fs)OcqM!_r%7V` z?kNh8&qN@Y!uU5!75)m#j{r{PYPH!vndPVQyv)Om$Yy*z`_->m&wSP+-g8LgKG;o1 zfs|Ka>t8SHd6VZgdCw678#|D{i}i2+*df)ZznJe>&)M8x^m^%$4)p9{`A>Pg&6L`N zIM{*wpMg{VO||vkkAZ6&ScN42Vf~xA{<|?VwySEdecVv%81KdSeQduTx6fw$ddBtm zHUjt%Yla+NEd8hLzSd0ElgthHILj{pPVJt><>KbT1AJ9pymMY$oQ8M(JXM|*C3x+q z%Iz(47nW9(d#Z)oT~y&-QChLQpwwODt*EMY7x>nQ!ius=yqD!EN}D_>GoyVWH{L%l zaTioo71X%#l2lcVD8{?k9(R$itgHq}EHO7Ey-}hCcyPI<+T&KQPnBHf^Q3tTmcz)J z8gErWd37nClts9TUK%3|kLMDt#1qaSc=ufeDpyo^D-^&XXu(U^H8q7RJ%!hTR(mU| zL8`{lpYiyEEX$Txl)6_Hl=?jGO8Lfh1dYV$#kL5$ir#CBh!=U(+vH+}r`%nDCzH#N ztFH?7DucU_ zQoE%Zs!)RPnq8F)6qOW(b+0b*7Or$xl)F6@#U#Y<)+6Mh3U-%yyahy;<9#}!s7@l~ zc<%?Ka3$57yR@JhO(x&U$D3=Ek!%q=URWvXx1EQTrILz*h*??#Jy%^>h~?wOa*&7PApBbuYC-|e0~H{b1au?E-71;RZ$ zci!~uT=%?LvlimrutnL^bDeH7t6DXVw}M*>`btZd7rG0peX>JA2G2~(RxPgbc(Sr) z=jKeG;U1qhJ}q6KyyO}}GzVUzhm%EfX3$`=NOrwyZxK>OD^ocu>(Fru zD{G?pmLh2LxGeA!ybFq^(`6|vC@n=D6?vBXR-i? zp`U5NSXzN5heyI|@t(Kz`bf3fXA)72vbE!TT0PDB1>TC1=vsmqC=7IyH^3~63%0IQ z?pdw!FJ4`RU$Ti#?sj9u)e{vB#qAEnH8rcN3Mx@CWq3PDmzUNN)X&uTpu*()Zg=6D z0-AvE!p!xy>|~`O1^Pur4Gni~+*G8Yycpg=y;X{?)FJtrTBS%Uukd=(vZv>a_7<$* z*otyr+Hzk>Y0>DCB9TV1l?52T)9^MH^eO7CQXIV0RZT4;#W>;yugX(eKnXZhS?U#O z(mT@-Ov9p3q{-1IjaI7=s*oddnr9`iPgfQ}iH@nHYN0A*3LU0Ylou38yXb8(1Zb2` zgO7u9De3| z*UvdHO{G-^l5wv%>BC{E?>m{xqdO3#UE(t-#2q z$UZvs^IDox8tY+ie?OSk^!hmrO&e_v%jRKkL>+h9(ubedNKt%kFN=rm*EsECSo7EW zHkvNyeJh<_=d0rn+S2RiKQzU*K-6I`KV6qo{<{72ex9b8whDAaX%pi2w)Fb`nx>^% zF{iWVf54VrKX;<(QCk6Yy=gOEK_C$)ceC*GDS5Xj3A?^+EYg3pp6|f0rVsC%Z&4}w=!8slIt|nPYQnVr4&K-4!|8X<*OH1lqN4&o+avQI zYr}Q=kv3cx$4YH3CR1c_{v)^mG!M}hq_$s=zvN!pcA1d>tb9lXim_j1J#@Yr>xn>n R>EHOBlAz~OtcNWs{uc{Na)bZ? diff --git a/analyse_syntaxique.output b/analyse_syntaxique.output deleted file mode 100644 index 82203d9..0000000 --- a/analyse_syntaxique.output +++ /dev/null @@ -1,1954 +0,0 @@ -Terminaux inutilisés dans la grammaire - - tENTIEREXP - tERROR - - -Grammaire - - 0 $accept: C $end - - 1 C: Fonctions - - 2 Fonctions: Main - 3 | Fonction Fonctions - - 4 $@1: %empty - - 5 Main: tINT tMAIN $@1 tPO Params tPF Body - - 6 $@2: %empty - - 7 Fonction: Function_type tVAR $@2 tPO Params tPF Body - - 8 Function_type: tINT - 9 | tINT tMUL - - 10 Params: %empty - 11 | Param SuiteParams - - 12 Param: Param_type tVAR - - 13 Param_type: tINT - 14 | tINT tMUL - - 15 SuiteParams: tVIRGULE Param SuiteParams - 16 | %empty - - 17 Body: tAO Instructions Return tAF - - 18 Instructions: Instruction Instructions - 19 | %empty - - 20 Instruction: Aff - 21 | If - 22 | While - 23 | Print - 24 | Decl - 25 | Invocation tPV - - 26 Decl: Type Valeur SuiteDecl tPV - - 27 SuiteDecl: tVIRGULE Valeur SuiteDecl - 28 | %empty - - 29 Type: tINT - 30 | tCONST tINT - 31 | tINT tMUL - - 32 $@3: %empty - - 33 Valeur: tVAR $@3 tAFFECTATION E - 34 | tVAR - - 35 Aff: tVAR tAFFECTATION E tPV - 36 | tMUL tVAR tAFFECTATION E tPV - - 37 E: tENTIER - 38 | tVAR - 39 | E tADD E - 40 | E tMUL E - 41 | E tSUB E - 42 | E tDIV E - 43 | tSUB E - 44 | Invocation - 45 | tPO E tPF - 46 | tAPPERSAND tVAR - 47 | tMUL tVAR - - 48 $@4: %empty - - 49 $@5: %empty - - 50 $@6: %empty - - 51 $@7: %empty - - 52 $@8: %empty - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 Instructions $@6 tAF $@7 $@8 Else - - 54 $@9: %empty - - 55 $@10: %empty - - 56 Else: tELSE tAO $@9 Instructions tAF $@10 - 57 | %empty - 58 | tELSE If - - 59 $@11: %empty - - 60 $@12: %empty - - 61 $@13: %empty - - 62 $@14: %empty - - 63 While: tWHILE tPO $@11 Cond tPF $@12 tAO $@13 Instructions tAF $@14 - - 64 Cond: E tEGAL E - 65 | E tDIFF E - 66 | E tLT E - 67 | E tGT E - 68 | E tLTE E - 69 | E tGTE E - 70 | E tAND E - 71 | E tOR E - 72 | tNOT Cond - 73 | E - - 74 $@15: %empty - - 75 Invocation: tVAR tPO $@15 Args tPF - - 76 Args: Arg SuiteArgs - 77 | %empty - - 78 Arg: E - - 79 SuiteArgs: tVIRGULE Arg SuiteArgs - 80 | %empty - - 81 Print: tPRINT tPO E tPF tPV - - 82 Return: tRETURN E tPV - - -Terminaux, suivis des règles où ils apparaissent - -$end (0) 0 -error (256) -tENTIER (258) 37 -tENTIEREXP (259) -tADD (260) 39 -tSUB (261) 41 43 -tMUL (262) 9 14 31 36 40 47 -tDIV (263) 42 -tPO (264) 5 7 45 53 63 75 81 -tPF (265) 5 7 45 53 63 75 81 -tAO (266) 17 53 56 63 -tAF (267) 17 53 56 63 -tERROR (268) -tAPPERSAND (269) 46 -tPV (270) 25 26 35 36 81 82 -tVIRGULE (271) 15 27 79 -tAFFECTATION (272) 33 35 36 -tEGAL (273) 64 -tDIFF (274) 65 -tLT (275) 66 -tGT (276) 67 -tGTE (277) 69 -tLTE (278) 68 -tMAIN (279) 5 -tINT (280) 5 8 9 13 14 29 30 31 -tPRINT (281) 81 -tRETURN (282) 82 -tOR (283) 71 -tAND (284) 70 -tIF (285) 53 -tELSE (286) 56 58 -tWHILE (287) 63 -tCONST (288) 30 -tVAR (289) 7 12 33 34 35 36 38 46 47 75 -tNOT (290) 72 - - -Non-terminaux, suivis des règles où ils apparaissent - -$accept (36) - à gauche: 0 -C (37) - à gauche: 1, à droite: 0 -Fonctions (38) - à gauche: 2 3, à droite: 1 3 -Main (39) - à gauche: 5, à droite: 2 -$@1 (40) - à gauche: 4, à droite: 5 -Fonction (41) - à gauche: 7, à droite: 3 -$@2 (42) - à gauche: 6, à droite: 7 -Function_type (43) - à gauche: 8 9, à droite: 7 -Params (44) - à gauche: 10 11, à droite: 5 7 -Param (45) - à gauche: 12, à droite: 11 15 -Param_type (46) - à gauche: 13 14, à droite: 12 -SuiteParams (47) - à gauche: 15 16, à droite: 11 15 -Body (48) - à gauche: 17, à droite: 5 7 -Instructions (49) - à gauche: 18 19, à droite: 17 18 53 56 63 -Instruction (50) - à gauche: 20 21 22 23 24 25, à droite: 18 -Decl (51) - à gauche: 26, à droite: 24 -SuiteDecl (52) - à gauche: 27 28, à droite: 26 27 -Type (53) - à gauche: 29 30 31, à droite: 26 -Valeur (54) - à gauche: 33 34, à droite: 26 27 -$@3 (55) - à gauche: 32, à droite: 33 -Aff (56) - à gauche: 35 36, à droite: 20 -E (57) - à gauche: 37 38 39 40 41 42 43 44 45 46 47, à droite: 33 35 36 - 39 40 41 42 43 45 64 65 66 67 68 69 70 71 73 78 81 82 -If (58) - à gauche: 53, à droite: 21 58 -$@4 (59) - à gauche: 48, à droite: 53 -$@5 (60) - à gauche: 49, à droite: 53 -$@6 (61) - à gauche: 50, à droite: 53 -$@7 (62) - à gauche: 51, à droite: 53 -$@8 (63) - à gauche: 52, à droite: 53 -Else (64) - à gauche: 56 57 58, à droite: 53 -$@9 (65) - à gauche: 54, à droite: 56 -$@10 (66) - à gauche: 55, à droite: 56 -While (67) - à gauche: 63, à droite: 22 -$@11 (68) - à gauche: 59, à droite: 63 -$@12 (69) - à gauche: 60, à droite: 63 -$@13 (70) - à gauche: 61, à droite: 63 -$@14 (71) - à gauche: 62, à droite: 63 -Cond (72) - à gauche: 64 65 66 67 68 69 70 71 72 73, à droite: 53 63 72 -Invocation (73) - à gauche: 75, à droite: 25 44 -$@15 (74) - à gauche: 74, à droite: 75 -Args (75) - à gauche: 76 77, à droite: 75 -Arg (76) - à gauche: 78, à droite: 76 79 -SuiteArgs (77) - à gauche: 79 80, à droite: 76 79 -Print (78) - à gauche: 81, à droite: 23 -Return (79) - à gauche: 82, à droite: 17 - - -État 0 - - 0 $accept: . C $end - - tINT décalage et aller à l'état 1 - - C aller à l'état 2 - Fonctions aller à l'état 3 - Main aller à l'état 4 - Fonction aller à l'état 5 - Function_type aller à l'état 6 - - -État 1 - - 5 Main: tINT . tMAIN $@1 tPO Params tPF Body - 8 Function_type: tINT . - 9 | tINT . tMUL - - tMUL décalage et aller à l'état 7 - tMAIN décalage et aller à l'état 8 - - $défaut réduction par utilisation de la règle 8 (Function_type) - - -État 2 - - 0 $accept: C . $end - - $end décalage et aller à l'état 9 - - -État 3 - - 1 C: Fonctions . - - $défaut réduction par utilisation de la règle 1 (C) - - -État 4 - - 2 Fonctions: Main . - - $défaut réduction par utilisation de la règle 2 (Fonctions) - - -État 5 - - 3 Fonctions: Fonction . Fonctions - - tINT décalage et aller à l'état 1 - - Fonctions aller à l'état 10 - Main aller à l'état 4 - Fonction aller à l'état 5 - Function_type aller à l'état 6 - - -État 6 - - 7 Fonction: Function_type . tVAR $@2 tPO Params tPF Body - - tVAR décalage et aller à l'état 11 - - -État 7 - - 9 Function_type: tINT tMUL . - - $défaut réduction par utilisation de la règle 9 (Function_type) - - -État 8 - - 5 Main: tINT tMAIN . $@1 tPO Params tPF Body - - $défaut réduction par utilisation de la règle 4 ($@1) - - $@1 aller à l'état 12 - - -État 9 - - 0 $accept: C $end . - - $défaut accepter - - -État 10 - - 3 Fonctions: Fonction Fonctions . - - $défaut réduction par utilisation de la règle 3 (Fonctions) - - -État 11 - - 7 Fonction: Function_type tVAR . $@2 tPO Params tPF Body - - $défaut réduction par utilisation de la règle 6 ($@2) - - $@2 aller à l'état 13 - - -État 12 - - 5 Main: tINT tMAIN $@1 . tPO Params tPF Body - - tPO décalage et aller à l'état 14 - - -État 13 - - 7 Fonction: Function_type tVAR $@2 . tPO Params tPF Body - - tPO décalage et aller à l'état 15 - - -État 14 - - 5 Main: tINT tMAIN $@1 tPO . Params tPF Body - - tINT décalage et aller à l'état 16 - - $défaut réduction par utilisation de la règle 10 (Params) - - Params aller à l'état 17 - Param aller à l'état 18 - Param_type aller à l'état 19 - - -État 15 - - 7 Fonction: Function_type tVAR $@2 tPO . Params tPF Body - - tINT décalage et aller à l'état 16 - - $défaut réduction par utilisation de la règle 10 (Params) - - Params aller à l'état 20 - Param aller à l'état 18 - Param_type aller à l'état 19 - - -État 16 - - 13 Param_type: tINT . - 14 | tINT . tMUL - - tMUL décalage et aller à l'état 21 - - $défaut réduction par utilisation de la règle 13 (Param_type) - - -État 17 - - 5 Main: tINT tMAIN $@1 tPO Params . tPF Body - - tPF décalage et aller à l'état 22 - - -État 18 - - 11 Params: Param . SuiteParams - - tVIRGULE décalage et aller à l'état 23 - - $défaut réduction par utilisation de la règle 16 (SuiteParams) - - SuiteParams aller à l'état 24 - - -État 19 - - 12 Param: Param_type . tVAR - - tVAR décalage et aller à l'état 25 - - -État 20 - - 7 Fonction: Function_type tVAR $@2 tPO Params . tPF Body - - tPF décalage et aller à l'état 26 - - -État 21 - - 14 Param_type: tINT tMUL . - - $défaut réduction par utilisation de la règle 14 (Param_type) - - -État 22 - - 5 Main: tINT tMAIN $@1 tPO Params tPF . Body - - tAO décalage et aller à l'état 27 - - Body aller à l'état 28 - - -État 23 - - 15 SuiteParams: tVIRGULE . Param SuiteParams - - tINT décalage et aller à l'état 16 - - Param aller à l'état 29 - Param_type aller à l'état 19 - - -État 24 - - 11 Params: Param SuiteParams . - - $défaut réduction par utilisation de la règle 11 (Params) - - -État 25 - - 12 Param: Param_type tVAR . - - $défaut réduction par utilisation de la règle 12 (Param) - - -État 26 - - 7 Fonction: Function_type tVAR $@2 tPO Params tPF . Body - - tAO décalage et aller à l'état 27 - - Body aller à l'état 30 - - -État 27 - - 17 Body: tAO . Instructions Return tAF - - tMUL décalage et aller à l'état 31 - tINT décalage et aller à l'état 32 - tPRINT décalage et aller à l'état 33 - tIF décalage et aller à l'état 34 - tWHILE décalage et aller à l'état 35 - tCONST décalage et aller à l'état 36 - tVAR décalage et aller à l'état 37 - - $défaut réduction par utilisation de la règle 19 (Instructions) - - Instructions aller à l'état 38 - Instruction aller à l'état 39 - Decl aller à l'état 40 - Type aller à l'état 41 - Aff aller à l'état 42 - If aller à l'état 43 - While aller à l'état 44 - Invocation aller à l'état 45 - Print aller à l'état 46 - - -État 28 - - 5 Main: tINT tMAIN $@1 tPO Params tPF Body . - - $défaut réduction par utilisation de la règle 5 (Main) - - -État 29 - - 15 SuiteParams: tVIRGULE Param . SuiteParams - - tVIRGULE décalage et aller à l'état 23 - - $défaut réduction par utilisation de la règle 16 (SuiteParams) - - SuiteParams aller à l'état 47 - - -État 30 - - 7 Fonction: Function_type tVAR $@2 tPO Params tPF Body . - - $défaut réduction par utilisation de la règle 7 (Fonction) - - -État 31 - - 36 Aff: tMUL . tVAR tAFFECTATION E tPV - - tVAR décalage et aller à l'état 48 - - -État 32 - - 29 Type: tINT . - 31 | tINT . tMUL - - tMUL décalage et aller à l'état 49 - - $défaut réduction par utilisation de la règle 29 (Type) - - -État 33 - - 81 Print: tPRINT . tPO E tPF tPV - - tPO décalage et aller à l'état 50 - - -État 34 - - 53 If: tIF . tPO Cond tPF $@4 tAO $@5 Instructions $@6 tAF $@7 $@8 Else - - tPO décalage et aller à l'état 51 - - -État 35 - - 63 While: tWHILE . tPO $@11 Cond tPF $@12 tAO $@13 Instructions tAF $@14 - - tPO décalage et aller à l'état 52 - - -État 36 - - 30 Type: tCONST . tINT - - tINT décalage et aller à l'état 53 - - -État 37 - - 35 Aff: tVAR . tAFFECTATION E tPV - 75 Invocation: tVAR . tPO $@15 Args tPF - - tPO décalage et aller à l'état 54 - tAFFECTATION décalage et aller à l'état 55 - - -État 38 - - 17 Body: tAO Instructions . Return tAF - - tRETURN décalage et aller à l'état 56 - - Return aller à l'état 57 - - -État 39 - - 18 Instructions: Instruction . Instructions - - tMUL décalage et aller à l'état 31 - tINT décalage et aller à l'état 32 - tPRINT décalage et aller à l'état 33 - tIF décalage et aller à l'état 34 - tWHILE décalage et aller à l'état 35 - tCONST décalage et aller à l'état 36 - tVAR décalage et aller à l'état 37 - - $défaut réduction par utilisation de la règle 19 (Instructions) - - Instructions aller à l'état 58 - Instruction aller à l'état 39 - Decl aller à l'état 40 - Type aller à l'état 41 - Aff aller à l'état 42 - If aller à l'état 43 - While aller à l'état 44 - Invocation aller à l'état 45 - Print aller à l'état 46 - - -État 40 - - 24 Instruction: Decl . - - $défaut réduction par utilisation de la règle 24 (Instruction) - - -État 41 - - 26 Decl: Type . Valeur SuiteDecl tPV - - tVAR décalage et aller à l'état 59 - - Valeur aller à l'état 60 - - -État 42 - - 20 Instruction: Aff . - - $défaut réduction par utilisation de la règle 20 (Instruction) - - -État 43 - - 21 Instruction: If . - - $défaut réduction par utilisation de la règle 21 (Instruction) - - -État 44 - - 22 Instruction: While . - - $défaut réduction par utilisation de la règle 22 (Instruction) - - -État 45 - - 25 Instruction: Invocation . tPV - - tPV décalage et aller à l'état 61 - - -État 46 - - 23 Instruction: Print . - - $défaut réduction par utilisation de la règle 23 (Instruction) - - -État 47 - - 15 SuiteParams: tVIRGULE Param SuiteParams . - - $défaut réduction par utilisation de la règle 15 (SuiteParams) - - -État 48 - - 36 Aff: tMUL tVAR . tAFFECTATION E tPV - - tAFFECTATION décalage et aller à l'état 62 - - -État 49 - - 31 Type: tINT tMUL . - - $défaut réduction par utilisation de la règle 31 (Type) - - -État 50 - - 81 Print: tPRINT tPO . E tPF tPV - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 69 - Invocation aller à l'état 70 - - -État 51 - - 53 If: tIF tPO . Cond tPF $@4 tAO $@5 Instructions $@6 tAF $@7 $@8 Else - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - tNOT décalage et aller à l'état 71 - - E aller à l'état 72 - Cond aller à l'état 73 - Invocation aller à l'état 70 - - -État 52 - - 63 While: tWHILE tPO . $@11 Cond tPF $@12 tAO $@13 Instructions tAF $@14 - - $défaut réduction par utilisation de la règle 59 ($@11) - - $@11 aller à l'état 74 - - -État 53 - - 30 Type: tCONST tINT . - - $défaut réduction par utilisation de la règle 30 (Type) - - -État 54 - - 75 Invocation: tVAR tPO . $@15 Args tPF - - $défaut réduction par utilisation de la règle 74 ($@15) - - $@15 aller à l'état 75 - - -État 55 - - 35 Aff: tVAR tAFFECTATION . E tPV - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 76 - Invocation aller à l'état 70 - - -État 56 - - 82 Return: tRETURN . E tPV - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 77 - Invocation aller à l'état 70 - - -État 57 - - 17 Body: tAO Instructions Return . tAF - - tAF décalage et aller à l'état 78 - - -État 58 - - 18 Instructions: Instruction Instructions . - - $défaut réduction par utilisation de la règle 18 (Instructions) - - -État 59 - - 33 Valeur: tVAR . $@3 tAFFECTATION E - 34 | tVAR . - - tAFFECTATION réduction par utilisation de la règle 32 ($@3) - $défaut réduction par utilisation de la règle 34 (Valeur) - - $@3 aller à l'état 79 - - -État 60 - - 26 Decl: Type Valeur . SuiteDecl tPV - - tVIRGULE décalage et aller à l'état 80 - - $défaut réduction par utilisation de la règle 28 (SuiteDecl) - - SuiteDecl aller à l'état 81 - - -État 61 - - 25 Instruction: Invocation tPV . - - $défaut réduction par utilisation de la règle 25 (Instruction) - - -État 62 - - 36 Aff: tMUL tVAR tAFFECTATION . E tPV - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 82 - Invocation aller à l'état 70 - - -État 63 - - 37 E: tENTIER . - - $défaut réduction par utilisation de la règle 37 (E) - - -État 64 - - 43 E: tSUB . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 83 - Invocation aller à l'état 70 - - -État 65 - - 47 E: tMUL . tVAR - - tVAR décalage et aller à l'état 84 - - -État 66 - - 45 E: tPO . E tPF - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 85 - Invocation aller à l'état 70 - - -État 67 - - 46 E: tAPPERSAND . tVAR - - tVAR décalage et aller à l'état 86 - - -État 68 - - 38 E: tVAR . - 75 Invocation: tVAR . tPO $@15 Args tPF - - tPO décalage et aller à l'état 54 - - $défaut réduction par utilisation de la règle 38 (E) - - -État 69 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 81 Print: tPRINT tPO E . tPF tPV - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - tPF décalage et aller à l'état 91 - - -État 70 - - 44 E: Invocation . - - $défaut réduction par utilisation de la règle 44 (E) - - -État 71 - - 72 Cond: tNOT . Cond - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - tNOT décalage et aller à l'état 71 - - E aller à l'état 72 - Cond aller à l'état 92 - Invocation aller à l'état 70 - - -État 72 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 64 Cond: E . tEGAL E - 65 | E . tDIFF E - 66 | E . tLT E - 67 | E . tGT E - 68 | E . tLTE E - 69 | E . tGTE E - 70 | E . tAND E - 71 | E . tOR E - 73 | E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - tEGAL décalage et aller à l'état 93 - tDIFF décalage et aller à l'état 94 - tLT décalage et aller à l'état 95 - tGT décalage et aller à l'état 96 - tGTE décalage et aller à l'état 97 - tLTE décalage et aller à l'état 98 - tOR décalage et aller à l'état 99 - tAND décalage et aller à l'état 100 - - $défaut réduction par utilisation de la règle 73 (Cond) - - -État 73 - - 53 If: tIF tPO Cond . tPF $@4 tAO $@5 Instructions $@6 tAF $@7 $@8 Else - - tPF décalage et aller à l'état 101 - - -État 74 - - 63 While: tWHILE tPO $@11 . Cond tPF $@12 tAO $@13 Instructions tAF $@14 - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - tNOT décalage et aller à l'état 71 - - E aller à l'état 72 - Cond aller à l'état 102 - Invocation aller à l'état 70 - - -État 75 - - 75 Invocation: tVAR tPO $@15 . Args tPF - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - $défaut réduction par utilisation de la règle 77 (Args) - - E aller à l'état 103 - Invocation aller à l'état 70 - Args aller à l'état 104 - Arg aller à l'état 105 - - -État 76 - - 35 Aff: tVAR tAFFECTATION E . tPV - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - tPV décalage et aller à l'état 106 - - -État 77 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 82 Return: tRETURN E . tPV - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - tPV décalage et aller à l'état 107 - - -État 78 - - 17 Body: tAO Instructions Return tAF . - - $défaut réduction par utilisation de la règle 17 (Body) - - -État 79 - - 33 Valeur: tVAR $@3 . tAFFECTATION E - - tAFFECTATION décalage et aller à l'état 108 - - -État 80 - - 27 SuiteDecl: tVIRGULE . Valeur SuiteDecl - - tVAR décalage et aller à l'état 59 - - Valeur aller à l'état 109 - - -État 81 - - 26 Decl: Type Valeur SuiteDecl . tPV - - tPV décalage et aller à l'état 110 - - -État 82 - - 36 Aff: tMUL tVAR tAFFECTATION E . tPV - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - tPV décalage et aller à l'état 111 - - -État 83 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 43 | tSUB E . - - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 43 (E) - - -État 84 - - 47 E: tMUL tVAR . - - $défaut réduction par utilisation de la règle 47 (E) - - -État 85 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 45 | tPO E . tPF - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - tPF décalage et aller à l'état 112 - - -État 86 - - 46 E: tAPPERSAND tVAR . - - $défaut réduction par utilisation de la règle 46 (E) - - -État 87 - - 39 E: E tADD . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 113 - Invocation aller à l'état 70 - - -État 88 - - 41 E: E tSUB . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 114 - Invocation aller à l'état 70 - - -État 89 - - 40 E: E tMUL . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 115 - Invocation aller à l'état 70 - - -État 90 - - 42 E: E tDIV . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 116 - Invocation aller à l'état 70 - - -État 91 - - 81 Print: tPRINT tPO E tPF . tPV - - tPV décalage et aller à l'état 117 - - -État 92 - - 72 Cond: tNOT Cond . - - $défaut réduction par utilisation de la règle 72 (Cond) - - -État 93 - - 64 Cond: E tEGAL . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 118 - Invocation aller à l'état 70 - - -État 94 - - 65 Cond: E tDIFF . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 119 - Invocation aller à l'état 70 - - -État 95 - - 66 Cond: E tLT . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 120 - Invocation aller à l'état 70 - - -État 96 - - 67 Cond: E tGT . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 121 - Invocation aller à l'état 70 - - -État 97 - - 69 Cond: E tGTE . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 122 - Invocation aller à l'état 70 - - -État 98 - - 68 Cond: E tLTE . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 123 - Invocation aller à l'état 70 - - -État 99 - - 71 Cond: E tOR . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 124 - Invocation aller à l'état 70 - - -État 100 - - 70 Cond: E tAND . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 125 - Invocation aller à l'état 70 - - -État 101 - - 53 If: tIF tPO Cond tPF . $@4 tAO $@5 Instructions $@6 tAF $@7 $@8 Else - - $défaut réduction par utilisation de la règle 48 ($@4) - - $@4 aller à l'état 126 - - -État 102 - - 63 While: tWHILE tPO $@11 Cond . tPF $@12 tAO $@13 Instructions tAF $@14 - - tPF décalage et aller à l'état 127 - - -État 103 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 78 Arg: E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 78 (Arg) - - -État 104 - - 75 Invocation: tVAR tPO $@15 Args . tPF - - tPF décalage et aller à l'état 128 - - -État 105 - - 76 Args: Arg . SuiteArgs - - tVIRGULE décalage et aller à l'état 129 - - $défaut réduction par utilisation de la règle 80 (SuiteArgs) - - SuiteArgs aller à l'état 130 - - -État 106 - - 35 Aff: tVAR tAFFECTATION E tPV . - - $défaut réduction par utilisation de la règle 35 (Aff) - - -État 107 - - 82 Return: tRETURN E tPV . - - $défaut réduction par utilisation de la règle 82 (Return) - - -État 108 - - 33 Valeur: tVAR $@3 tAFFECTATION . E - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 131 - Invocation aller à l'état 70 - - -État 109 - - 27 SuiteDecl: tVIRGULE Valeur . SuiteDecl - - tVIRGULE décalage et aller à l'état 80 - - $défaut réduction par utilisation de la règle 28 (SuiteDecl) - - SuiteDecl aller à l'état 132 - - -État 110 - - 26 Decl: Type Valeur SuiteDecl tPV . - - $défaut réduction par utilisation de la règle 26 (Decl) - - -État 111 - - 36 Aff: tMUL tVAR tAFFECTATION E tPV . - - $défaut réduction par utilisation de la règle 36 (Aff) - - -État 112 - - 45 E: tPO E tPF . - - $défaut réduction par utilisation de la règle 45 (E) - - -État 113 - - 39 E: E . tADD E - 39 | E tADD E . - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 39 (E) - - -État 114 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 41 | E tSUB E . - 42 | E . tDIV E - - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 41 (E) - - -État 115 - - 39 E: E . tADD E - 40 | E . tMUL E - 40 | E tMUL E . - 41 | E . tSUB E - 42 | E . tDIV E - - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 40 (E) - - -État 116 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 42 | E tDIV E . - - $défaut réduction par utilisation de la règle 42 (E) - - -État 117 - - 81 Print: tPRINT tPO E tPF tPV . - - $défaut réduction par utilisation de la règle 81 (Print) - - -État 118 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 64 Cond: E tEGAL E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 64 (Cond) - - -État 119 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 65 Cond: E tDIFF E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 65 (Cond) - - -État 120 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 66 Cond: E tLT E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 66 (Cond) - - -État 121 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 67 Cond: E tGT E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 67 (Cond) - - -État 122 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 69 Cond: E tGTE E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 69 (Cond) - - -État 123 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 68 Cond: E tLTE E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 68 (Cond) - - -État 124 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 71 Cond: E tOR E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 71 (Cond) - - -État 125 - - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - 70 Cond: E tAND E . - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 70 (Cond) - - -État 126 - - 53 If: tIF tPO Cond tPF $@4 . tAO $@5 Instructions $@6 tAF $@7 $@8 Else - - tAO décalage et aller à l'état 133 - - -État 127 - - 63 While: tWHILE tPO $@11 Cond tPF . $@12 tAO $@13 Instructions tAF $@14 - - $défaut réduction par utilisation de la règle 60 ($@12) - - $@12 aller à l'état 134 - - -État 128 - - 75 Invocation: tVAR tPO $@15 Args tPF . - - $défaut réduction par utilisation de la règle 75 (Invocation) - - -État 129 - - 79 SuiteArgs: tVIRGULE . Arg SuiteArgs - - tENTIER décalage et aller à l'état 63 - tSUB décalage et aller à l'état 64 - tMUL décalage et aller à l'état 65 - tPO décalage et aller à l'état 66 - tAPPERSAND décalage et aller à l'état 67 - tVAR décalage et aller à l'état 68 - - E aller à l'état 103 - Invocation aller à l'état 70 - Arg aller à l'état 135 - - -État 130 - - 76 Args: Arg SuiteArgs . - - $défaut réduction par utilisation de la règle 76 (Args) - - -État 131 - - 33 Valeur: tVAR $@3 tAFFECTATION E . - 39 E: E . tADD E - 40 | E . tMUL E - 41 | E . tSUB E - 42 | E . tDIV E - - tADD décalage et aller à l'état 87 - tSUB décalage et aller à l'état 88 - tMUL décalage et aller à l'état 89 - tDIV décalage et aller à l'état 90 - - $défaut réduction par utilisation de la règle 33 (Valeur) - - -État 132 - - 27 SuiteDecl: tVIRGULE Valeur SuiteDecl . - - $défaut réduction par utilisation de la règle 27 (SuiteDecl) - - -État 133 - - 53 If: tIF tPO Cond tPF $@4 tAO . $@5 Instructions $@6 tAF $@7 $@8 Else - - $défaut réduction par utilisation de la règle 49 ($@5) - - $@5 aller à l'état 136 - - -État 134 - - 63 While: tWHILE tPO $@11 Cond tPF $@12 . tAO $@13 Instructions tAF $@14 - - tAO décalage et aller à l'état 137 - - -État 135 - - 79 SuiteArgs: tVIRGULE Arg . SuiteArgs - - tVIRGULE décalage et aller à l'état 129 - - $défaut réduction par utilisation de la règle 80 (SuiteArgs) - - SuiteArgs aller à l'état 138 - - -État 136 - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 . Instructions $@6 tAF $@7 $@8 Else - - tMUL décalage et aller à l'état 31 - tINT décalage et aller à l'état 32 - tPRINT décalage et aller à l'état 33 - tIF décalage et aller à l'état 34 - tWHILE décalage et aller à l'état 35 - tCONST décalage et aller à l'état 36 - tVAR décalage et aller à l'état 37 - - $défaut réduction par utilisation de la règle 19 (Instructions) - - Instructions aller à l'état 139 - Instruction aller à l'état 39 - Decl aller à l'état 40 - Type aller à l'état 41 - Aff aller à l'état 42 - If aller à l'état 43 - While aller à l'état 44 - Invocation aller à l'état 45 - Print aller à l'état 46 - - -État 137 - - 63 While: tWHILE tPO $@11 Cond tPF $@12 tAO . $@13 Instructions tAF $@14 - - $défaut réduction par utilisation de la règle 61 ($@13) - - $@13 aller à l'état 140 - - -État 138 - - 79 SuiteArgs: tVIRGULE Arg SuiteArgs . - - $défaut réduction par utilisation de la règle 79 (SuiteArgs) - - -État 139 - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 Instructions . $@6 tAF $@7 $@8 Else - - $défaut réduction par utilisation de la règle 50 ($@6) - - $@6 aller à l'état 141 - - -État 140 - - 63 While: tWHILE tPO $@11 Cond tPF $@12 tAO $@13 . Instructions tAF $@14 - - tMUL décalage et aller à l'état 31 - tINT décalage et aller à l'état 32 - tPRINT décalage et aller à l'état 33 - tIF décalage et aller à l'état 34 - tWHILE décalage et aller à l'état 35 - tCONST décalage et aller à l'état 36 - tVAR décalage et aller à l'état 37 - - $défaut réduction par utilisation de la règle 19 (Instructions) - - Instructions aller à l'état 142 - Instruction aller à l'état 39 - Decl aller à l'état 40 - Type aller à l'état 41 - Aff aller à l'état 42 - If aller à l'état 43 - While aller à l'état 44 - Invocation aller à l'état 45 - Print aller à l'état 46 - - -État 141 - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 Instructions $@6 . tAF $@7 $@8 Else - - tAF décalage et aller à l'état 143 - - -État 142 - - 63 While: tWHILE tPO $@11 Cond tPF $@12 tAO $@13 Instructions . tAF $@14 - - tAF décalage et aller à l'état 144 - - -État 143 - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 Instructions $@6 tAF . $@7 $@8 Else - - $défaut réduction par utilisation de la règle 51 ($@7) - - $@7 aller à l'état 145 - - -État 144 - - 63 While: tWHILE tPO $@11 Cond tPF $@12 tAO $@13 Instructions tAF . $@14 - - $défaut réduction par utilisation de la règle 62 ($@14) - - $@14 aller à l'état 146 - - -État 145 - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 Instructions $@6 tAF $@7 . $@8 Else - - $défaut réduction par utilisation de la règle 52 ($@8) - - $@8 aller à l'état 147 - - -État 146 - - 63 While: tWHILE tPO $@11 Cond tPF $@12 tAO $@13 Instructions tAF $@14 . - - $défaut réduction par utilisation de la règle 63 (While) - - -État 147 - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 Instructions $@6 tAF $@7 $@8 . Else - - tELSE décalage et aller à l'état 148 - - $défaut réduction par utilisation de la règle 57 (Else) - - Else aller à l'état 149 - - -État 148 - - 56 Else: tELSE . tAO $@9 Instructions tAF $@10 - 58 | tELSE . If - - tAO décalage et aller à l'état 150 - tIF décalage et aller à l'état 34 - - If aller à l'état 151 - - -État 149 - - 53 If: tIF tPO Cond tPF $@4 tAO $@5 Instructions $@6 tAF $@7 $@8 Else . - - $défaut réduction par utilisation de la règle 53 (If) - - -État 150 - - 56 Else: tELSE tAO . $@9 Instructions tAF $@10 - - $défaut réduction par utilisation de la règle 54 ($@9) - - $@9 aller à l'état 152 - - -État 151 - - 58 Else: tELSE If . - - $défaut réduction par utilisation de la règle 58 (Else) - - -État 152 - - 56 Else: tELSE tAO $@9 . Instructions tAF $@10 - - tMUL décalage et aller à l'état 31 - tINT décalage et aller à l'état 32 - tPRINT décalage et aller à l'état 33 - tIF décalage et aller à l'état 34 - tWHILE décalage et aller à l'état 35 - tCONST décalage et aller à l'état 36 - tVAR décalage et aller à l'état 37 - - $défaut réduction par utilisation de la règle 19 (Instructions) - - Instructions aller à l'état 153 - Instruction aller à l'état 39 - Decl aller à l'état 40 - Type aller à l'état 41 - Aff aller à l'état 42 - If aller à l'état 43 - While aller à l'état 44 - Invocation aller à l'état 45 - Print aller à l'état 46 - - -État 153 - - 56 Else: tELSE tAO $@9 Instructions . tAF $@10 - - tAF décalage et aller à l'état 154 - - -État 154 - - 56 Else: tELSE tAO $@9 Instructions tAF . $@10 - - $défaut réduction par utilisation de la règle 55 ($@10) - - $@10 aller à l'état 155 - - -État 155 - - 56 Else: tELSE tAO $@9 Instructions tAF $@10 . - - $défaut réduction par utilisation de la règle 56 (Else) diff --git a/analyse_syntaxique.tab.c b/analyse_syntaxique.tab.c deleted file mode 100644 index 5e64f70..0000000 --- a/analyse_syntaxique.tab.c +++ /dev/null @@ -1,2017 +0,0 @@ -/* 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 "analyse_syntaxique.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 "analyse_syntaxique.tab.h". */ -#ifndef YY_YY_ANALYSE_SYNTAXIQUE_TAB_H_INCLUDED -# define YY_YY_ANALYSE_SYNTAXIQUE_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 - { - tENTIER = 258, - tENTIEREXP = 259, - tADD = 260, - tSUB = 261, - tMUL = 262, - tDIV = 263, - tPO = 264, - tPF = 265, - tAO = 266, - tAF = 267, - tERROR = 268, - tAPPERSAND = 269, - tPV = 270, - tVIRGULE = 271, - tAFFECTATION = 272, - tEGAL = 273, - tDIFF = 274, - tLT = 275, - tGT = 276, - tGTE = 277, - tLTE = 278, - tMAIN = 279, - tINT = 280, - tPRINT = 281, - tRETURN = 282, - tOR = 283, - tAND = 284, - tIF = 285, - tELSE = 286, - tWHILE = 287, - tCONST = 288, - tVAR = 289, - tNOT = 290 - }; -#endif - -/* Value type. */ -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED - -union YYSTYPE -{ -#line 1 "analyse_syntaxique.y" /* yacc.c:355 */ - -int nombre; -char id[30]; - -#line 148 "analyse_syntaxique.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_ANALYSE_SYNTAXIQUE_TAB_H_INCLUDED */ - -/* Copy the second part of user declarations. */ -#line 6 "analyse_syntaxique.y" /* yacc.c:358 */ - -#include -#include "table_symboles.h" -#include "table_fonctions.h" -#include "gen_assembleur.h" - -enum Initialised_Variable init; -enum Symbole_Type type; -enum Return_Type return_type; -Table_Symboles table; -Table_Fonctions table_fonctions; -instructions_array array; -int whileCondition; -int return_value; - -#line 180 "analyse_syntaxique.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 9 -/* YYLAST -- Last index in YYTABLE. */ -#define YYLAST 156 - -/* YYNTOKENS -- Number of terminals. */ -#define YYNTOKENS 36 -/* YYNNTS -- Number of nonterminals. */ -#define YYNNTS 44 -/* YYNRULES -- Number of rules. */ -#define YYNRULES 83 -/* YYNSTATES -- Number of states. */ -#define YYNSTATES 156 - -/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned - by yylex, with out-of-bounds checking. */ -#define YYUNDEFTOK 2 -#define YYMAXUTOK 290 - -#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, 31, 32, 33, 34, - 35 -}; - -#if YYDEBUG - /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ -static const yytype_uint8 yyrline[] = -{ - 0, 83, 83, 85, 86, 89, 89, 90, 90, 92, - 93, 95, 96, 98, 100, 101, 103, 104, 107, 109, - 110, 112, 113, 114, 115, 116, 117, 119, 121, 122, - 124, 125, 126, 128, 128, 129, 132, 133, 136, 137, - 138, 139, 140, 141, 142, 143, 149, 150, 151, 154, - 160, 160, 160, 161, 154, 167, 167, 167, 168, 169, - 171, 173, 179, 179, 171, 186, 187, 188, 189, 190, - 191, 192, 193, 194, 195, 197, 197, 204, 205, 206, - 207, 208, 210, 212 -}; -#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", "tENTIER", "tENTIEREXP", "tADD", "tSUB", - "tMUL", "tDIV", "tPO", "tPF", "tAO", "tAF", "tERROR", "tAPPERSAND", - "tPV", "tVIRGULE", "tAFFECTATION", "tEGAL", "tDIFF", "tLT", "tGT", - "tGTE", "tLTE", "tMAIN", "tINT", "tPRINT", "tRETURN", "tOR", "tAND", - "tIF", "tELSE", "tWHILE", "tCONST", "tVAR", "tNOT", "$accept", "C", - "Fonctions", "Main", "$@1", "Fonction", "$@2", "Function_type", "Params", - "Param", "Param_type", "SuiteParams", "Body", "Instructions", - "Instruction", "Decl", "SuiteDecl", "Type", "Valeur", "$@3", "Aff", "E", - "If", "$@4", "$@5", "$@6", "$@7", "$@8", "Else", "$@9", "$@10", "While", - "$@11", "$@12", "$@13", "$@14", "Cond", "Invocation", "$@15", "Args", - "Arg", "SuiteArgs", "Print", "Return", 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, 286, 287, 288, 289, 290 -}; -# endif - -#define YYPACT_NINF -62 - -#define yypact_value_is_default(Yystate) \ - (!!((Yystate) == (-62))) - -#define YYTABLE_NINF -34 - -#define yytable_value_is_error(Yytable_value) \ - 0 - - /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -static const yytype_int16 yypact[] = -{ - -14, -4, 15, -62, -62, -14, -15, -62, -62, -62, - -62, -62, 12, 25, -1, -1, 30, 34, 39, 22, - 48, -62, 51, -1, -62, -62, 51, 50, -62, 39, - -62, 27, 52, 64, 68, 70, 47, 0, 66, 50, - -62, 62, -62, -62, -62, 82, -62, -62, 83, -62, - 29, 19, -62, -62, -62, 29, 29, 87, -62, 90, - 85, -62, 29, -62, 29, 74, 29, 76, 102, 84, - -62, 19, 98, 105, 19, 29, 59, 63, -62, 95, - 62, 107, 80, -2, -62, 123, -62, 29, 29, 29, - 29, 108, -62, 29, 29, 29, 29, 29, 29, 29, - 29, -62, 114, 129, 122, 124, -62, -62, 29, 85, - -62, -62, -62, 23, -2, 130, -62, -62, 129, 129, - 129, 129, 129, 129, 129, 129, 128, -62, -62, 29, - -62, 129, -62, -62, 131, 124, 50, -62, -62, -62, - 50, 132, 133, -62, -62, -62, -62, 110, -7, -62, - -62, -62, 50, 134, -62, -62 -}; - - /* 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, 9, 0, 2, 3, 0, 0, 10, 5, 1, - 4, 7, 0, 0, 11, 11, 14, 0, 17, 0, - 0, 15, 0, 0, 12, 13, 0, 20, 6, 17, - 8, 0, 30, 0, 0, 0, 0, 0, 0, 20, - 25, 0, 21, 22, 23, 0, 24, 16, 0, 32, - 0, 0, 60, 31, 75, 0, 0, 0, 19, 35, - 29, 26, 0, 38, 0, 0, 0, 0, 39, 0, - 45, 0, 74, 0, 0, 78, 0, 0, 18, 0, - 0, 0, 0, 44, 48, 0, 47, 0, 0, 0, - 0, 0, 73, 0, 0, 0, 0, 0, 0, 0, - 0, 49, 0, 79, 0, 81, 36, 83, 0, 29, - 27, 37, 46, 40, 42, 41, 43, 82, 65, 66, - 67, 68, 70, 69, 72, 71, 0, 61, 76, 0, - 77, 34, 28, 50, 0, 81, 20, 62, 80, 51, - 20, 0, 0, 52, 63, 53, 64, 58, 0, 54, - 55, 59, 20, 0, 56, 57 -}; - - /* YYPGOTO[NTERM-NUM]. */ -static const yytype_int16 yypgoto[] = -{ - -62, -62, 138, -62, -62, -62, -62, -62, 135, 125, - -62, 118, 126, -38, -62, -62, 40, -62, 71, -62, - -62, -48, 5, -62, -62, -62, -62, -62, -62, -62, - -62, -62, -62, -62, -62, -62, -61, -27, -62, -62, - 26, 21, -62, -62 -}; - - /* YYDEFGOTO[NTERM-NUM]. */ -static const yytype_int16 yydefgoto[] = -{ - -1, 2, 3, 4, 12, 5, 13, 6, 17, 18, - 19, 24, 28, 38, 39, 40, 81, 41, 60, 79, - 42, 72, 43, 126, 136, 141, 145, 147, 149, 152, - 155, 44, 74, 134, 140, 146, 73, 70, 75, 104, - 105, 130, 46, 57 -}; - - /* 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_int16 yytable[] = -{ - 45, 58, 69, 7, 150, 89, 90, 76, 77, 54, - 92, 1, 45, 102, 82, 9, 83, 55, 85, 11, - 8, 14, 63, 34, 16, 64, 65, 103, 66, 88, - 89, 90, 63, 67, 15, 64, 65, 21, 66, 113, - 114, 115, 116, 67, 22, 118, 119, 120, 121, 122, - 123, 124, 125, 68, 71, 23, 25, 31, 26, 49, - 131, 48, 27, 68, 87, 88, 89, 90, 87, 88, - 89, 90, 53, 50, 106, 32, 33, 51, 107, 52, - 34, 103, 35, 36, 37, 87, 88, 89, 90, 87, - 88, 89, 90, 56, 91, 111, 59, 61, 139, 78, - 62, 80, 142, 87, 88, 89, 90, -33, 84, 45, - 86, 54, 108, 45, 153, 101, 93, 94, 95, 96, - 97, 98, 110, 117, 127, 45, 99, 100, 87, 88, - 89, 90, 128, 112, 87, 88, 89, 90, 90, 133, - 129, 148, 137, 10, 143, 144, 154, 47, 29, 132, - 20, 109, 30, 151, 0, 135, 138 -}; - -static const yytype_int16 yycheck[] = -{ - 27, 39, 50, 7, 11, 7, 8, 55, 56, 9, - 71, 25, 39, 74, 62, 0, 64, 17, 66, 34, - 24, 9, 3, 30, 25, 6, 7, 75, 9, 6, - 7, 8, 3, 14, 9, 6, 7, 7, 9, 87, - 88, 89, 90, 14, 10, 93, 94, 95, 96, 97, - 98, 99, 100, 34, 35, 16, 34, 7, 10, 7, - 108, 34, 11, 34, 5, 6, 7, 8, 5, 6, - 7, 8, 25, 9, 15, 25, 26, 9, 15, 9, - 30, 129, 32, 33, 34, 5, 6, 7, 8, 5, - 6, 7, 8, 27, 10, 15, 34, 15, 136, 12, - 17, 16, 140, 5, 6, 7, 8, 17, 34, 136, - 34, 9, 17, 140, 152, 10, 18, 19, 20, 21, - 22, 23, 15, 15, 10, 152, 28, 29, 5, 6, - 7, 8, 10, 10, 5, 6, 7, 8, 8, 11, - 16, 31, 11, 5, 12, 12, 12, 29, 23, 109, - 15, 80, 26, 148, -1, 129, 135 -}; - - /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -static const yytype_uint8 yystos[] = -{ - 0, 25, 37, 38, 39, 41, 43, 7, 24, 0, - 38, 34, 40, 42, 9, 9, 25, 44, 45, 46, - 44, 7, 10, 16, 47, 34, 10, 11, 48, 45, - 48, 7, 25, 26, 30, 32, 33, 34, 49, 50, - 51, 53, 56, 58, 67, 73, 78, 47, 34, 7, - 9, 9, 9, 25, 9, 17, 27, 79, 49, 34, - 54, 15, 17, 3, 6, 7, 9, 14, 34, 57, - 73, 35, 57, 72, 68, 74, 57, 57, 12, 55, - 16, 52, 57, 57, 34, 57, 34, 5, 6, 7, - 8, 10, 72, 18, 19, 20, 21, 22, 23, 28, - 29, 10, 72, 57, 75, 76, 15, 15, 17, 54, - 15, 15, 10, 57, 57, 57, 57, 15, 57, 57, - 57, 57, 57, 57, 57, 57, 59, 10, 10, 16, - 77, 57, 52, 11, 69, 76, 60, 11, 77, 49, - 70, 61, 49, 12, 12, 62, 71, 63, 31, 64, - 11, 58, 65, 49, 12, 66 -}; - - /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ -static const yytype_uint8 yyr1[] = -{ - 0, 36, 37, 38, 38, 40, 39, 42, 41, 43, - 43, 44, 44, 45, 46, 46, 47, 47, 48, 49, - 49, 50, 50, 50, 50, 50, 50, 51, 52, 52, - 53, 53, 53, 55, 54, 54, 56, 56, 57, 57, - 57, 57, 57, 57, 57, 57, 57, 57, 57, 59, - 60, 61, 62, 63, 58, 65, 66, 64, 64, 64, - 68, 69, 70, 71, 67, 72, 72, 72, 72, 72, - 72, 72, 72, 72, 72, 74, 73, 75, 75, 76, - 77, 77, 78, 79 -}; - - /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ -static const yytype_uint8 yyr2[] = -{ - 0, 2, 1, 1, 2, 0, 7, 0, 7, 1, - 2, 0, 2, 2, 1, 2, 3, 0, 4, 2, - 0, 1, 1, 1, 1, 1, 2, 4, 3, 0, - 1, 2, 2, 0, 4, 1, 4, 5, 1, 1, - 3, 3, 3, 3, 2, 1, 3, 2, 2, 0, - 0, 0, 0, 0, 13, 0, 0, 6, 0, 2, - 0, 0, 0, 0, 11, 3, 3, 3, 3, 3, - 3, 3, 3, 2, 1, 0, 5, 2, 0, 1, - 3, 0, 5, 3 -}; - - -#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 5: -#line 89 "analyse_syntaxique.y" /* yacc.c:1646 */ - {add_function(&table_fonctions, "Main", RET_INT, array.index); table.depth++;} -#line 1368 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 6: -#line 89 "analyse_syntaxique.y" /* yacc.c:1646 */ - {print_table(&table);remove_symboles(&table); table.depth--;} -#line 1374 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 7: -#line 90 "analyse_syntaxique.y" /* yacc.c:1646 */ - {{add_function(&table_fonctions, (yyvsp[0].id), return_type, array.index); table.depth++;}} -#line 1380 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 8: -#line 90 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_0(&array, RET_FUN); print_table(&table);remove_symboles(&table); table.depth--;} -#line 1386 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 9: -#line 92 "analyse_syntaxique.y" /* yacc.c:1646 */ - {type = TYPE_INT;} -#line 1392 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 10: -#line 93 "analyse_syntaxique.y" /* yacc.c:1646 */ - {type = TYPE_INT_PTR;} -#line 1398 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 11: -#line 95 "analyse_syntaxique.y" /* yacc.c:1646 */ - {} -#line 1404 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 13: -#line 98 "analyse_syntaxique.y" /* yacc.c:1646 */ - {add_symbole_top(&table, (yyvsp[0].id), type, INITIALISED, table.depth);} -#line 1410 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 14: -#line 100 "analyse_syntaxique.y" /* yacc.c:1646 */ - {type = TYPE_INT;} -#line 1416 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 15: -#line 101 "analyse_syntaxique.y" /* yacc.c:1646 */ - {type = TYPE_INT_PTR;} -#line 1422 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 18: -#line 107 "analyse_syntaxique.y" /* yacc.c:1646 */ - {} -#line 1428 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 19: -#line 109 "analyse_syntaxique.y" /* yacc.c:1646 */ - {(yyval.nombre) = array.index;} -#line 1434 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 20: -#line 110 "analyse_syntaxique.y" /* yacc.c:1646 */ - {(yyval.nombre) = array.index;} -#line 1440 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 30: -#line 124 "analyse_syntaxique.y" /* yacc.c:1646 */ - {type = TYPE_INT;} -#line 1446 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 31: -#line 125 "analyse_syntaxique.y" /* yacc.c:1646 */ - {type = TYPE_CONST_INT;} -#line 1452 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 32: -#line 126 "analyse_syntaxique.y" /* yacc.c:1646 */ - {type = TYPE_INT_PTR;} -#line 1458 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 33: -#line 128 "analyse_syntaxique.y" /* yacc.c:1646 */ - {add_symbole_top(&table, (yyvsp[0].id), type, INITIALISED, table.depth);} -#line 1464 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 34: -#line 128 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int varAddr = variable_exists(&table, (yyvsp[-3].id)); generate_instruction_2(&array, COP, varAddr, (yyvsp[0].nombre)); free_temp(&table);} -#line 1470 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 35: -#line 129 "analyse_syntaxique.y" /* yacc.c:1646 */ - {add_symbole_top(&table, (yyvsp[0].id), type, NOT_INITIALISED, table.depth);} -#line 1476 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 36: -#line 132 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int varAddr = variable_exists(&table, (yyvsp[-3].id)); generate_instruction_2(&array, COP, varAddr, (yyvsp[-1].nombre)); free_temp(&table);} -#line 1482 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 37: -#line 133 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int varAddr = variable_exists(&table, (yyvsp[-3].id)); generate_instruction_2(&array, COP_STR, varAddr, (yyvsp[-1].nombre)); free_temp(&table);} -#line 1488 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 38: -#line 136 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int vt = new_temp(&table); generate_instruction_2(&array, AFC, vt, (yyvsp[0].nombre)); (yyval.nombre) = vt;} -#line 1494 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 39: -#line 137 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int vt = new_temp(&table); int varAddr = variable_exists(&table, (yyvsp[0].id)); generate_instruction_2(&array, COP, vt, varAddr); (yyval.nombre) = vt;} -#line 1500 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 40: -#line 138 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, ADD, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[-2].nombre);} -#line 1506 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 41: -#line 139 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, MUL, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[-2].nombre);} -#line 1512 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 42: -#line 140 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, SOU, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[-2].nombre);} -#line 1518 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 43: -#line 141 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, DIV, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[-2].nombre);} -#line 1524 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 44: -#line 142 "analyse_syntaxique.y" /* yacc.c:1646 */ - {printf("Variable negative\n");} -#line 1530 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 45: -#line 143 "analyse_syntaxique.y" /* yacc.c:1646 */ - { - int vt = new_temp(&table); - generate_instruction_2(&array, COP, vt, (yyvsp[0].nombre)); - remove_symboles(&table); - table.depth--; - (yyval.nombre) = vt;} -#line 1541 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 46: -#line 149 "analyse_syntaxique.y" /* yacc.c:1646 */ - {printf("Parenthèse\n"); (yyval.nombre) = (yyvsp[-1].nombre); } -#line 1547 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 47: -#line 150 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int vt = new_temp(&table); int varAddr = variable_exists(&table, (yyvsp[0].id)); generate_instruction_2(&array, LEA, vt, varAddr); (yyval.nombre) = vt;} -#line 1553 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 48: -#line 151 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int vt = new_temp(&table); int varAddr = variable_exists(&table, (yyvsp[0].id)); generate_instruction_2(&array, COP, vt, varAddr); generate_instruction_2(&array, COP_LD, vt, vt); (yyval.nombre) = vt;} -#line 1559 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 49: -#line 154 "analyse_syntaxique.y" /* yacc.c:1646 */ - { - //gen_jmpf(&table, &array, $3, -1); - generate_instruction_2(&array, JMF, (yyvsp[-1].nombre), -1); - free_temp(&table); - (yyvsp[-3].nombre) = array.index; -} -#line 1570 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 50: -#line 160 "analyse_syntaxique.y" /* yacc.c:1646 */ - {table.depth++;} -#line 1576 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 51: -#line 160 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_1(&array, JMP, -1);} -#line 1582 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 52: -#line 160 "analyse_syntaxique.y" /* yacc.c:1646 */ - {remove_symboles(&table); table.depth--;} -#line 1588 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 53: -#line 161 "analyse_syntaxique.y" /* yacc.c:1646 */ - { - int adr_jmp = array.index; - update_jmf(&array, (yyvsp[-10].nombre), adr_jmp); -} -#line 1597 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 54: -#line 165 "analyse_syntaxique.y" /* yacc.c:1646 */ - {printf("updating jump\n"); update_jmp(&array, (yyvsp[-5].nombre), (yyvsp[0].nombre));} -#line 1603 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 55: -#line 167 "analyse_syntaxique.y" /* yacc.c:1646 */ - {table.depth++;} -#line 1609 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 56: -#line 167 "analyse_syntaxique.y" /* yacc.c:1646 */ - {remove_symboles(&table); table.depth--;} -#line 1615 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 57: -#line 167 "analyse_syntaxique.y" /* yacc.c:1646 */ - {(yyval.nombre) = array.index;} -#line 1621 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 58: -#line 168 "analyse_syntaxique.y" /* yacc.c:1646 */ - {(yyval.nombre) = array.index;} -#line 1627 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 59: -#line 169 "analyse_syntaxique.y" /* yacc.c:1646 */ - {(yyval.nombre) = array.index;} -#line 1633 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 60: -#line 171 "analyse_syntaxique.y" /* yacc.c:1646 */ - { - (yyvsp[0].nombre) = array.index ; -} -#line 1641 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 61: -#line 173 "analyse_syntaxique.y" /* yacc.c:1646 */ - { - //gen_jmpf(&table, &array, $4, -1); - generate_instruction_2(&array, JMF, (yyvsp[-1].nombre), -1); - free_temp(&table); - (yyvsp[-4].nombre) = array.index; -} -#line 1652 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 62: -#line 179 "analyse_syntaxique.y" /* yacc.c:1646 */ - {table.depth++;} -#line 1658 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 63: -#line 179 "analyse_syntaxique.y" /* yacc.c:1646 */ - {remove_symboles(&table); table.depth--;} -#line 1664 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 64: -#line 179 "analyse_syntaxique.y" /* yacc.c:1646 */ - { - int adr_jmp = array.index; - update_jmf(&array, (yyvsp[-10].nombre), adr_jmp); - //gen_jmpf(&table, &array, $1, $2); - generate_instruction_1(&array, JMP, (yyvsp[-9].nombre)); -} -#line 1675 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 65: -#line 186 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, EQ, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1681 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 66: -#line 187 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, NEQ, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1687 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 67: -#line 188 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, LT, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1693 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 68: -#line 189 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, GT, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1699 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 69: -#line 190 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, LTE, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1705 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 70: -#line 191 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, GTE, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1711 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 71: -#line 192 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, AND, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1717 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 72: -#line 193 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_3(&array, OR, (yyvsp[-2].nombre), (yyvsp[-2].nombre), (yyvsp[0].nombre)); free_temp(&table); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1723 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 73: -#line 194 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_2(&array, NOT, (yyvsp[0].nombre), (yyvsp[0].nombre)); (yyval.nombre) = (yyvsp[0].nombre);} -#line 1729 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 74: -#line 195 "analyse_syntaxique.y" /* yacc.c:1646 */ - {(yyval.nombre) = (yyvsp[0].nombre); } -#line 1735 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 75: -#line 197 "analyse_syntaxique.y" /* yacc.c:1646 */ - {table.depth++; prepare_function_call(&table); return_value = (table.indexAvailableTop - 1);} -#line 1741 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 76: -#line 198 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int function_index = function_exists(&table_fonctions, (yyvsp[-4].id)); - int jmp_addr = (table_fonctions.array[function_index]).start_addr; - generate_instruction_2(&array, CALL, jmp_addr, (array.index + 1)); - (yyval.nombre) = return_value; - } -#line 1751 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 79: -#line 206 "analyse_syntaxique.y" /* yacc.c:1646 */ - {int arg_addr = prepare_argument_push(&table); generate_instruction_2(&array, COP, arg_addr, (yyvsp[0].nombre)); free_temp(&table);} -#line 1757 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 82: -#line 210 "analyse_syntaxique.y" /* yacc.c:1646 */ - {generate_instruction_1(&array, PRI, (yyvsp[-2].nombre)); free_temp(&table);} -#line 1763 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - case 83: -#line 212 "analyse_syntaxique.y" /* yacc.c:1646 */ - {(yyval.nombre) = generate_instruction_1(&array, RET, (yyvsp[-1].nombre)); free_temp(&table);} -#line 1769 "analyse_syntaxique.tab.c" /* yacc.c:1646 */ - break; - - -#line 1773 "analyse_syntaxique.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 214 "analyse_syntaxique.y" /* yacc.c:1906 */ - -#include -void main(void){ - //TODO: rajouter gestion des erreurs - initialise_table(&table); - initialise_function_table(&table_fonctions); - initialise_asm(&array); - yyparse(); - print_table(&table); - printf("\n"); - print_fonction_table(&table_fonctions); - - //remove_symboles(&table, 0); - //print_table(&table); - exportInstructions(&array); -} - diff --git a/analyse_syntaxique.tab.h b/analyse_syntaxique.tab.h deleted file mode 100644 index ee2c5cb..0000000 --- a/analyse_syntaxique.tab.h +++ /dev/null @@ -1,107 +0,0 @@ -/* 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_ANALYSE_SYNTAXIQUE_TAB_H_INCLUDED -# define YY_YY_ANALYSE_SYNTAXIQUE_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 - { - tENTIER = 258, - tENTIEREXP = 259, - tADD = 260, - tSUB = 261, - tMUL = 262, - tDIV = 263, - tPO = 264, - tPF = 265, - tAO = 266, - tAF = 267, - tERROR = 268, - tAPPERSAND = 269, - tPV = 270, - tVIRGULE = 271, - tAFFECTATION = 272, - tEGAL = 273, - tDIFF = 274, - tLT = 275, - tGT = 276, - tGTE = 277, - tLTE = 278, - tMAIN = 279, - tINT = 280, - tPRINT = 281, - tRETURN = 282, - tOR = 283, - tAND = 284, - tIF = 285, - tELSE = 286, - tWHILE = 287, - tCONST = 288, - tVAR = 289, - tNOT = 290 - }; -#endif - -/* Value type. */ -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED - -union YYSTYPE -{ -#line 1 "analyse_syntaxique.y" /* yacc.c:1909 */ - -int nombre; -char id[30]; - -#line 95 "analyse_syntaxique.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_ANALYSE_SYNTAXIQUE_TAB_H_INCLUDED */ diff --git a/analyse_syntaxique.y b/analyse_syntaxique.y index d37b973..4660fcb 100644 --- a/analyse_syntaxique.y +++ b/analyse_syntaxique.y @@ -80,14 +80,14 @@ Fonctions : Fonction Fonctions ; Fonction : tINT tVAR tPO Params tPF Body;*/ -C : Fonctions; +C : {generate_instruction_1(&array, JMP, -1);} Fonctions; Fonctions: Main; Fonctions: Fonction Fonctions; -Main : tINT tMAIN {add_function(&table_fonctions, "Main", RET_INT, array.index); table.depth++;} tPO Params tPF Body {print_table(&table);remove_symboles(&table); table.depth--;}; -Fonction : Function_type tVAR {{add_function(&table_fonctions, $2, return_type, array.index); table.depth++;}} tPO Params tPF Body {generate_instruction_0(&array, RET_FUN); print_table(&table);remove_symboles(&table); table.depth--;}; +Main : tINT tMAIN {update_jmp(&array, 0, array.index); add_function(&table_fonctions, "Main", RET_INT, array.index); table.depth++;} tPO Params tPF Body {print_table(&table);remove_symboles(&table); table.depth--;}; +Fonction : Function_type tVAR {{add_function(&table_fonctions, $2, return_type, array.index); table.depth++;}} tPO Params tPF Body {print_table(&table);remove_symboles(&table); table.depth--;}; Function_type: tINT {type = TYPE_INT;} ; Function_type: tINT tMUL {type = TYPE_INT_PTR;}; @@ -129,8 +129,8 @@ Valeur : tVAR {add_symbole_top(&table, $1, type, INITIALISED, table.depth);} tAF Valeur : tVAR {add_symbole_top(&table, $1, type, NOT_INITIALISED, table.depth);}; -Aff : tVAR tAFFECTATION E tPV {int varAddr = variable_exists(&table, $1); generate_instruction_2(&array, COP, varAddr, $3); free_temp(&table);}; -Aff : tMUL tVAR tAFFECTATION E tPV {int varAddr = variable_exists(&table, $2); generate_instruction_2(&array, COP_STR, varAddr, $4); free_temp(&table);}; +Aff : tVAR tAFFECTATION E tPV {int varAddr = variable_exists(&table, $1); generate_instruction_2(&array, COP, varAddr, $3); free_temp(&table); }; +Aff : tMUL tVAR tAFFECTATION E tPV {int varAddr = variable_exists(&table, $2); generate_instruction_2(&array, COP_STR, varAddr, $4); free_temp(&table); }; E : tENTIER {int vt = new_temp(&table); generate_instruction_2(&array, AFC, vt, $1); $$ = vt;}; @@ -141,11 +141,11 @@ E : E tSUB E {generate_instruction_3(&array, SOU, $1, $1, $3); free_temp(&table) E : E tDIV E {generate_instruction_3(&array, DIV, $1, $1, $3); free_temp(&table); $$ = $1;} ; E : tSUB E {printf("Variable negative\n");} ; E : Invocation { - int vt = new_temp(&table); - generate_instruction_2(&array, COP, vt, $1); + //int vt = new_temp(&table); + //generate_instruction_2(&array, COP, vt, $1); remove_symboles(&table); table.depth--; - $$ = vt;}; + $$ = $1;}; E : tPO E tPF {printf("Parenthèse\n"); $$ = $2; } ; E : tAPPERSAND tVAR {int vt = new_temp(&table); int varAddr = variable_exists(&table, $2); generate_instruction_2(&array, LEA, vt, varAddr); $$ = vt;}; E : tMUL tVAR {int vt = new_temp(&table); int varAddr = variable_exists(&table, $2); generate_instruction_2(&array, COP, vt, varAddr); generate_instruction_2(&array, COP_LD, vt, vt); $$ = vt;}; @@ -194,10 +194,10 @@ Cond : E tOR E {generate_instruction_3(&array, OR, $1, $1, $3); free_temp(&table Cond : tNOT Cond {generate_instruction_2(&array, NOT, $2, $2); $$ = $2;} ; Cond : E {$$ = $1; }; -Invocation : tVAR tPO {table.depth++; prepare_function_call(&table); return_value = (table.indexAvailableTop - 1);} Args tPF +Invocation : tVAR tPO {table.depth++; prepare_function_call(&table); return_value = (table.indexAvailableBottom);} Args tPF {int function_index = function_exists(&table_fonctions, $1); int jmp_addr = (table_fonctions.array[function_index]).start_addr; - generate_instruction_2(&array, CALL, jmp_addr, (array.index + 1)); + generate_instruction_2(&array, CALL, jmp_addr, table.indexAvailableTop); $$ = return_value; }; diff --git a/gen_assembleur.c b/gen_assembleur.c index 7d32bff..c2c7bfa 100644 --- a/gen_assembleur.c +++ b/gen_assembleur.c @@ -173,13 +173,13 @@ void exportInstructions(instructions_array * array){ switch (op) { //0 parameters case RET_FUN: - fprintf(file, "%d\t %s\n", i, operationName(op)); + fprintf(file, "%s\n", operationName(op)); break; //1 parameter case JMP: case PRI: case RET: - fprintf(file, "%d\t %s %d\n", i, operationName(op), instru.reg1); + fprintf(file, "%s %d\n", operationName(op), instru.reg1); break; //2 parameters case JMF: @@ -188,13 +188,13 @@ void exportInstructions(instructions_array * array){ case COP: case LEA: case CALL: - fprintf(file, "%d\t %s %d %d\n", i, operationName(op), instru.reg1, instru.reg2); + fprintf(file, "%s %d %d\n", operationName(op), instru.reg1, instru.reg2); break; case COP_LD: - fprintf(file, "%d\t %s %d [%d]\n", i, operationName(op), instru.reg1, instru.reg2); + fprintf(file, "%s %d [%d]\n", operationName(op), instru.reg1, instru.reg2); break; case COP_STR: - fprintf(file, "%d\t %s [%d] %d\n", i, operationName(op), instru.reg1, instru.reg2); + fprintf(file, "%s [%d] %d\n", operationName(op), instru.reg1, instru.reg2); break; //3 parameters case ADD: @@ -209,7 +209,7 @@ void exportInstructions(instructions_array * array){ case LTE: case GT: case GTE: - fprintf(file, "%d\t %s %d %d %d\n", i, operationName(op), instru.reg1, instru.reg2, instru.reg3); + fprintf(file, "%s %d %d %d\n", operationName(op), instru.reg1, instru.reg2, instru.reg3); break; default: break; diff --git a/instructions.md b/instructions.md new file mode 100644 index 0000000..3d30949 --- /dev/null +++ b/instructions.md @@ -0,0 +1,70 @@ +## Instructions generated by our compiler + +# ADD @A @B @C +> Adds the values stored in B and C and stores the result in A + +# SOU @A @B @C +> Substracts the values stored in B and C and stores the result in A + +# MUL @A @B @C +> Multiplies the values stored in B and C and stores the result in A + +# DIV @A @B @C +> Divides the values stored in B and C and stores the result in A + +# COP @A @B +> Copies at address A the contents from at address B + +# AFC @A #B +> Copies at address A the value B + +# JMF @A #B +> If the value located at address A is equal to 0 jumps to instruction number B + +# JMP #A +> Jumps to instruction number A + +# EQ @A @B @C +> If values located at adresses B and C are equal, writes 1 at address A else writes 0 + +# NEQ @A @B @C +> If values located at addresses B and C are not equal, writes 1 at address A else writes 0 + +# LT @A @B @C +> If value located at address B is less than the one located at address C, writes 1 at address A else writes 0 + +# GT @A @B @C +> If value located at address B is greater than the one located at address C, writes 1 at address A else writes 0 + +#LTE @A @B @C +> If value located at address B is less than or equal to the one located at address C, writes 1 at address A else writes 0 + +# GTE @A @B @C +> If value located at address B is greater than or equal to the one located at address C, writes 1 at address A else writes 0 + +# AND @A @B @C +> If the values located at addresses B and C are both greater or equal to 1 writes 1 at address A, else writes 0 + +# OR @A @B @C +> If the values located at addresses B and C are both equal to 0 writes 0 at address A, else writes 1 + +# NOT @A @B +> If the value at address B is greater or equal to 1, writes 0 at address A else writes 1 + +# PRI @A +> Prints the content located at address A + +# LEA @A @B +> Copies the value of the address B at A + +# COP_LD @A @B +> Copies the value pointed by B at address A + +# COP_STR @A @B +> Copies the value of B at the address pointed by A + +# RET @A +> Stores the return value at A, changes the values of EBP and ESP + +# CALL #A #B +> Saves the values of EBP and the return address, upadtes EBP to EBP + B and jumps to instruction number A diff --git a/instructions.txt b/instructions.txt index f3acc5a..8a5ed67 100644 --- a/instructions.txt +++ b/instructions.txt @@ -1,16 +1,26 @@ -0 AFC 49 4 -1 COP 1 49 -2 AFC 49 1 -3 RET 49 -4 RET_FUN -5 AFC 49 2 -6 COP 0 49 -7 LEA 49 0 -8 COP 1 49 -9 AFC 49 2 -10 COP_STR [1] 49 -11 COP 49 1 -12 COP_LD 49 [49] -13 COP 2 49 -14 AFC 49 0 -15 RET 49 +JMP 8 +COP 255 0 +COP_LD 255 [255] +COP 1 255 +COP 255 1 +PRI 255 +AFC 255 1 +RET 255 +AFC 255 21 +COP 0 255 +LEA 255 0 +COP 1 255 +COP 255 1 +COP 5 255 +CALL 1 6 +COP 2 255 +COP 255 2 +PRI 255 +LEA 255 2 +COP 1 255 +AFC 255 2 +COP_STR [1] 255 +COP 255 2 +PRI 255 +AFC 255 0 +RET 255 diff --git a/interpreter/.DS_Store b/interpreter/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..af774dac104ff16e3c10927e1da75b71c30abbb9 GIT binary patch literal 6148 zcmeHK-EPw`82!8!=5#{z0%^PS4H6gC)Tx6ZO-NB07rjFYf(t-hvKAVVB~{|mjZ%~w z-T`<69)&01L3jW-{$XmH?v_o+Uu2&z_IK>~II&|QV%^DLkElsR97$olfozSbdX*}+ zVM`Q`={6+olB6?|y`&QD3Y-E?f$OG#`gT2vDWx$@@atK{k0~yLm(GByL>h5VMN0IfP zWm$6JhtczRIPEv@JkC-X#_2HE@HoY?2NN-A-UCIQO{MZ|=-yozDH1 z=nF4Bk5J(Dri={!mbRg450AL-(+Tg1n2E`E;eT$_*)WDdb0u7bfBL*{clnWc@ zTPzJ4Ix&0rV76ywPbf_Hj`oEPC*~V;xl_O?u&hAM+&0zz|K#%X|1!zlIR%^o|CIu) zeiR&aF(kXURtBf`T7h(oq)f$?1~mnl-Hx@Rw&EQmZKxB<0s0n8gD8Qy9|0|c%bWuL GRDnO`5Vqm~ literal 0 HcmV?d00001 diff --git a/interpreter/input.txt b/interpreter/input.txt new file mode 100644 index 0000000..6fcd492 --- /dev/null +++ b/interpreter/input.txt @@ -0,0 +1,26 @@ +JMP 8 +COP 49 0 +COP_LD 49 [49] +COP 1 49 +COP 49 1 +PRI 49 +AFC 49 1 +RET 49 +AFC 49 21 +COP 0 49 +LEA 49 0 +COP 1 49 +COP 49 1 +COP 5 49 +CALL 1 6 +COP 2 49 +COP 49 2 +PRI 49 +LEA 49 2 +COP 1 49 +AFC 49 2 +COP_STR [1] 49 +COP 49 2 +PRI 49 +AFC 49 0 +RET 49 \ No newline at end of file diff --git a/interpreter/interpreter b/interpreter/interpreter new file mode 100755 index 0000000000000000000000000000000000000000..5585c3406162f01a0ee2dddf9ee0876c9cde91ef GIT binary patch literal 37492 zcmeHweSDO~wf}6giy^RXzyy&OSy7Pi8W0o+s|jTFK?xud#TUA4HXD+fH}j&TZEk~0 zN**4zqAhBFZEdc#mU?aFTBXz%NKi@aZ8g|dxfX3yYM-_A8ZDL}l-%z*Gta&epg%wT z>-Wo(&pdO^%$YN1&YYP!GdsI^{qw(`I!_2&st_UtAp=1hB1DUD0}|pQ1P#IGTbX~I z_crgU6_lFz*b>nJG2$}?75IFsy=zt{l5qKTiD^RN4kS~6Nc{MG^}!AG3PF_2uPqae zLHY~xB@N;B7&#%$@u<&NSKm-v7fnj$cSoV*SF0#2+$xZ!_{HQSe!j9`MNN>(B=hT5 z{9aQG2q(QqpVQAcJeTS&sUJYI^VZs z#qyh0bIv-+hYgexfb&BJi-+u&0`)y5`F!iEV_G{izbT;QXPqpsFt)b~ECeyh)e7cP zuDFaEC6`;J0p}-4E~`&`z6!suuCcPXy24jeUwcM=qyv7ykJ@ED7^`Bmg&_9%O8oWy zSVFRV4=eeUID+taezB4gf_+q1R#sP8>B;twSJq>-jd0R`{NwW#*TqKH>H6#4 zB+FR#L1p9ROXf%YAm^iHOPAl^Em$h8Lx^oj{m@LDgs2}WW8xFfYoZX%Ih55bL>i(r z#A^^+&$?zI+$hkzQHU}KL^ex$*II<2ah(|!VjU(X8g?rY=$Wj-T*S8_#P<`>gr{t) z5YrM;Byv6?H^Oj)Sq*iyvntAqXO%QolmMq^ECTV(C^~xGtACmQ)}E<=AiL7>m;dl-O)u(G#NJ-lt~C8sy-N#c^wW0feN{C+AYh?WZ z5OwEtG_2EmG6ju~%s^?tsRUmlVLQQD5+(&jhDvw{!T-Ri4(QJ#_!9}I5&S0!4<-1& zCF~^lHxfRd;0_792!2+=83g}C!XpU&zJx~-e7}U#32u?_1q3%rIFsN?31<=Pm+&xx zizGaX;H472kYJC5M-x0-!ovxkB;kt)zDUAj2zCO7lHF@a$@9%!IAB9Bjt8pSpog(U z6TxX!s>B%1fF#=) znfD+^_TJEjJece%@IYQ8Cpy0(^SU%6&kZv(7SvPYu93~25a^x}Q%;(77 z)tQ$^Vj|-znc?Or>k^Jo$XJ@Dr8?&jx}eLo`EDW(JKngN%3ypK9@1=GsQLJp(blan zGu_)~H1(MsIQWB7o&cThJ*XK&VZdgn=^$p8OJ#kXD50t0>v)b38i9oeG5jLSPGA-= z9FM8g$fA?|{bm(rN4=w^T`%l%ZTdEt@X$8AT_Mxv+B7O5A;q<6CnbD_SEpkG_|RiM zj}yvJA7r2tPc&ngYKHDu020GF0dMMxuJ8O3y(Equ54B$$YPad$!;z~YLdY|lIJsKr zpc51IlSSZp4-l3l(khwmLTZ9;-YExJ4V$6!JII8JG$X4MshVB{17O`m)_l%wZlh$w z`R^Rrsbisk$J0#g_!c5_vgEWP%BhJnW1P;1_9Bo)L|D$SXAI_7^FEUEzmE6!8{U&z z=;ge%FKv4mgfAkzitu}c_YnSya2&yb_KrXpkC2Tp4Wcm zG$-O{8&(zq6^OqoiB;>Kr`G-FFpSW@Yn>gK8Od~RB}xN}M92Hg;O9AnV`kT#cT-lU zBbS)qiTnp%C^3smIM-0LF~S1C;O`A1x6^wxO%g4n+(6+`HhSttM=w4MW5yltQAL{m zn)yl=l61$LloRs2hR8CRu;+Xd)}AEnlguOQ9g0X^8vs4Yb^Lb|Za>m-1 zToVd}Q2KLgdQ+d?aCEPRn#^NRi-yHt3pJUsdauXoZf;FSR=|4{@?!bQAFUZ6GxA1j z4zhOA^K(>K=F)lwCL7XXOdQ1II%0yX&b%qImzuz%q0g*V>98$#ynJEDk1%J!r1zIn zl-0=*&nyt!d5}@(Ph{p3vCIr){*X{wSsl70+rkkI3#2=yGh;^+66M1CRX}TBDs@fR zg!U-?gdLMWW;mB1PcJ;lCE+fRicBj1}RE$uIfwzLmmd`r7ktKiK= zTY3a625RYCCG(kD`WW(0Z)sIR4XUM)1XfG(T;J}@YyPt>&$a6<>5W2s7%p6K>dqm6 zFg*f9r>=cTjjtN46z{E|mN`?nfmx{>snrplnKUYl1IH%;rhA*CtUqw1=!~o*gl^o& z!^U=i*3)mOIZRuCk@Z(p4;GI|7C+#~-WA%g2qO?~EiG8LNihu0BgX+#6>>1o9LG+A zn8D2;{t;S$0n@;aJPR0w$IHUYqlMY)INa&&0TJ5Wlj}X~3SS8rMu743yxo}Ix`k`A2RJ5K{v^@0X{=;_hb+I=DzAGV=3$FY zh67&suvD4heHbQ5}2@3(j*~#wGy)R?9c7+_*+YQMZ~V zRF;`ag|t*mtC(6N8PReY%Dsnjh~cbg#)dQ*$L8Jr<^wKjIEw4}X>!#j(#||ucBnVH z5+~vtuY$Skv8ya{5dwuTOGm86PpOVuIda~{5zUtas4%h{gI(JQJ-RUtzrjmfrOoujTN6_hgM)s(82T3=(9fI%Batpg#y$`uUm$Sg0`jp^v z=oIBBs_{7-qrxm?>qOmFh{I)>KVw64k+qI&R4)3 z>+Bw?++2a8UZ_uZ{FVy9F)e8IKIm%6VrHJ@B*;ZdknJ6L3(TcyNPIm(*G5tOdyyD_SA zfnx5t4sW?%9u26|dx%wMcz#M8HvoyaWjZQG^BwPei6ZB_9NB4$K^c+rBoW?3)I+(J zZk$grZPtHqg!*&yN4vfel9am=D0dLn5wS@RtPPy1xRA4&BT_mIu!c7CYV;k%Si$L8 zD>>q(A=|M)7FuW(O7L@Xv1ph+Y8VR}c6_i@37hJiLM3$PC9?ddYpIT`zj36D)yT3V zbH9BA)qX${ypc%o0nq&g*e-+ODM_(2o0VC#9=i!!AvM^k>-hi1)8TN8l+n z^`W~;zyf3RVyU)Un4xnGMWM5wJJla0pV{+{W}Q3z@H0wqW-^PcEQ)aMgeq(RQH7dk zkKRG8cYekZG!F+MexB`BMn>LN13d3e6BaGZ4~cn*oY<)UPx2d%XECc`i_UI)cwQEk zbKY}LoP<3$S&;5MYNi57^zTAPa=86^L$BF+8D@Yqz3_-ed(d}K2$KbB$38$$0od1> zw@4ZK4!Q4?oab7cJM-p)FSOp& z3td4ZNYT`5t_B1h+=Yntpg-tne$VFG)uDTT7fA;Vc_6=I{)YE=VBe?bPdB_rbZ@uW zdnuY#)U9Kq^m0zJf2;c6eCktDtH*acctzW@3K)9mCXUY9L%H5QH5LDaW%rDdjFdGE zm5kCUlGc<7vd9`1JUS^Y1-ixY8SXEk(hm{w`PDm&XYJ=`UMEMHpKAK`@F|=JW#&(0 z<`c0@H)$0F_ep|n6w%@5kN<|VFUOC7vcB1nToam6v$Y?R?X>+8dIy~# z7oV*t%e93(Ztx|O=#8q-#q~QgIARsbJ%Dm1uI3M9jr; z8b*z&&7ew9Uk~~INTIq3hO5CbjjbM>m=J3MHOnmnNUpi0a!ab|7FBF8qU@qrYMum} zdd$zI0H}(r3PBydY$A%&=0m1nU16Sq%4u2B^!;-F;fZuW{YKYUl<&39is(?c>7c38 zspVa_I}^Yk@zXcV<4!|{8SAoXWB zev^QQ8OM%a`7dF|E69)HI4_|S1V=L$8bF`y>!7D}M`aR;9PhFGqJi=a$F-bn$!pb@ zlSFLg)A-<-07G%fO;CPxVY?C-hT>Hmoplo6BlBYFxR9qGhiNe$p8^Aqzj4Go&g21N zX=@^bFdTbinY|RLiNqXY#=#J#{vusYanL$CSD7}5o~u-oDv zUavPES&2Ce$1S_S2?ub$;Andu%_8Av*U^^S@a)4F*Nkh(aqVoGjx4HQ)1P(oT(doc zqRtk9i2R1mmZKPEMAF%^ND+6oQRh0(&C^p-SW5jjcA9ChN$ zh`~%XBTQvVb$m(`W+ujV5&*~0*lZoZSrAu{%Tzf0z>Ej}vKmQ`B=6Ovt=D z0~<~)ms{f6%yav+VO&tMrt=ieOdt$_1bx97%plsT9-3~-IfKsXG)F4EVJw$m0R*dq zlplJLBFnjZ9&4c-0EWztwvGhk*2!c0!=u4M(dbf*2G_*LKB}gcZYpHRsKZP_UW%3~ z8O!RE>f#PCwyU~QAS-=Dupyx?Nn_QOVzsKJOV-8FfOTo%7HLpnRt)V&Xz7G}j6*M< zT*#>G&#;sNhfz3?aBz3(35H@=6e&!Bg&&hE8xL429%fdym0v@E34j8m=_Iy>7bOwYThKJ2VQGK@0p2y(t~ z-N%b~*ii&LHhScW8o?PS@mheqjq~ZlUDsyROi7cGqy=b5+L7Ygl?hp1hKBj5ZZ|F9 zdJE%#gu$TBW7FVwY72?1^IM89Tw7;>bT>RAk<00>t-M_dFoKGncgsfSZl^Ks+Qb9k zEs#Sm#0?~UM8dMf^nxbN0g+V;J0=prF%|Q89q-xg)0l}ADe_dbM5-eCAx>OEFY+`Y z?ZV(WBh-#oP%3mXasjCv^EvNF!j2T+Y9C~M!rbaGO*@*go#qjFd}gOs=+9CD zcHGz7Bac#6w7WOD2WplSek6pKqa><@rzLrszMW<|7#s6tgwM*d-_!!H8JVs6_CDkr z(uVe((7Qt)jned%-AHt8ZpLJQHqFEq3R4)RMQ>DC9BVLtOWrH-v4(`w_yc|O8Zz9) z#6qPHOiOlRUO=>?&Phv?llfl5|#gb`7BI!W==8W}cH49EJHO)E_Zv zjGtArWP;`|iS~ta(vmM=hKY9DIcaG&G5thaa!y)0M>XdW?fi4n(jsLJC0e?Fa`v{- ztZcr6{)zMeiqgjQz(}I_F86;NMb2K@ZkRu(^vC1U|YO^u4t5 zn^zNwKb|By7&7+KnX@^LDBwp%ndI!n@*&K*lzw?!dVKYxh~j-x1J6vrFf-xQ|5rv> zj%A)Bw7~JDdiT=ozNJ_&m)Z7PQ-?(}nrDyWTK4DC-*^)QlooS+&N%yoX-dEhqy>0d z(8BXJVS#Y%8a_(r$xBXQp~!eGZ~&Ph%G@)26!=jE1+Km61-4gpp5bzNwQ}9J9E}LQ zNORsTuKV(V#3nX#3>D9WlO$KYy*Ud$b+wF7pt%g&Y&oYBiwI>JJXMEG2tl{+QdkIk zy3Q3wO8-tvqMWH)PytP2U%vvS(n1|JeEuEw48y`=zJLiul3|K3l4L7EMl<+*s#u=F z$!)IwB0>3T@Wj;wWSlHo2hMe?yR_2#5W{vpvfB~J6ch&@;w5Vjo5`g$A>^U%tQ-tVJPT5%G@3SPMvFf~tOik4gTCTKRU%ig?iqJAXu7wreiBOs-#H&mpMa{8?=F(&)BJoU22I zk?bH*nrm;4{w(+Dhwz?cyR6j~AH9$=U!IM~2+M`?SNOD7E|grek)z*bH@HQLO(jm= zJ6q<0HA>?S8(tDczhQ;J3w`AwY1@$^vmiEAbPFotr8`^V*D-#|wF#O-epW8>XxXJ%N}T)lgl`q+~HU{4Avs{qU$FR z|Dk;7zuLFM-w^4aN+iwIvJ}~LyicFy(Ah)_wFg6DB?)FYE15SbG(7KZ$^Bh8 zBH(^SjQd}yihJ>rT+dT8$DNAxdx-hiVKF+o5I452dQw_`CUX?ir}{9XdNHgX;RS}s#}$nN-Lj>)15`fW!i3O7_lZQS_k?S!6M}67LaP5B zKBGUe#e3p1d`i_$1{FO|oc(I7Yqxm&@!_6Pbkwz{&pbh=aq1J9g4p@v>~=-JrI3hS zdyeb-^bYekan#MIILaSgspEh|nJrIpw1&cL9>5GD%_fM&2xj9L3Qex1%&@0fCQU@r z?DlAr$gu*$xnO7%p3F^ieQ#fD5w$D&sTDbhM$<`?>d?I>BYSz$@hp+-ehcSEo%N{C zV{+t~TR%RqL%-nKSI2vHOt|k(gUN51o1WL&aLh_J3exR5^@*ecnuf6!hYqK^Mh&>A z zmn6sMnc8D6OycNzDvsp=xV#YZB@mrW$SIO#nPj;=ndP)Nj$fA??>Yy^zhUh}vqwpe zOOiP1-b1+KyZG25QUV%pe<*UfZjSsnRv6Xbu;(FJZVQ)l{sQH=x0-tO%wI;Hl9cG1f0JYZkl~X= zx(59%Q$$jQoxqD;WhfD6K zu4LIU&Gh0V2DbN_WcM_(BPKis^!(eB=8Ut^4q4>uC^Gw1uy_LWY*(R04~f>oKe#qQ z0mSHjWS}N9w5V0MwqwTr!xrx!utGK>efAqWYS zFm=%I%y(_?$Z!6nKmYF?HaVb3^@K=1NO}{qeUg4@A{xwwgEVl zN)As;4u6~*n-8fpbD}o6~IPWabG z)-Wp(3}qtCwLII?JsaKm5#Eu}#LaL_gly8^cm#d~l)fG5@^e;P#My|w!EX^JV=u4) zp&Q|1`2HF~3BoTBvako3h27;}5b6LQKnMeN!TGrlVFWgkr3jBBmAh0yPe zI+ewCi_@{o6y)_2&G`t_(c}=*Hiuki3;>adkcBV`;X(u&9LaTFq|(NycYX8`i!1Ran)yhbi`;3Da{}-g$e#sl60otrFN35PGUfG1 z$xx8wp7R;rf^;Xp8L&w&#oL;q-EG;&6}u>+Jbla|8W)rvuh`9{QGSW*GX} zj^4JT&t1^x2=xC2z%pSCcK#a$ecPdR8XFT~Qjfc_bcza?MT!bpoJF8s%dlc)NHEhW|N z7;;|P(DY%$o#(qUMvTllkvVGgMPtUE7Zx|f5wjOXWqnrVD@8D$BDQ;osvD3I+Z&Vb~o?JtL86Qn7hbx^)-3f^(D{owN)9NB|Gx4S;Rix068R#K53(qhyDsj@M#G&cK$$Q}^3v)S{p3`-H z#s!%p;1P``Pe(mqpJK<8nhFb54?u?_ge?AIs;b@oKz(_2mAkaMp{hhwH`KeUOWh@nRsPEIfV(nSSzX(R zQtrk^U!XSVuMhf)8%j%qwNtXsN=xGH{Z$P$@nzf<)zx?U%Yy#6T&uh^pvJ};e{Ee5MzpNFD(Ie6vJlpj zE|xC8b_M#~%3BE<)amwCm86S;U`4Q=1!5C~Wt5acMPRYIy4qdY5GaEV@srXGY+QBI z-8B#lRa91&l$SQT@Ag+T1gWD6^Vj&6;>Vm<6)jo46u;{1yJ_id-kIq_3Kqw9>GGTN zmn|)D`%6k{-Tr!ag_JbP82v|#>&uYGH05>Fi?#l$^+9)zyS|#MD)bhvSamB`60M`5 z3R3%v{Z%E^RlyQ>2?PUmO>OY*^6G{<*%Oe6wNcB&#liLERS79DyL2(B1dK#}L4i9D zpoiYKPbyjKo@PPmqOfRLQs&fH=1nV#k}_w+G7Fa8oRm2$mbqlb%EZick$>$Hl{5*W zU0=A88YRJN-T3kF5=%OjylizM2lpb2z55#XY&0wH(;{Hzu+23_!H}G^$Gmpjx?VsU<6Pvpl(rCQr6;f;^!jG_%2d>or`SX&4{ z!L*1CN68E>&B6>4Gd~vPy>S+7}UU^1_m`SsDVKZ3~FFd1A`hE)WH9H z8tB1U0UZc@q~fD0KBeNcOH87}wK@ALQU{C{JOamh>73=8x z0VDE!K6yRK7bv^ax4r?_ki?C(Vw+4a!JVp_D1xg~Q5ZL+2%&#bjq(k}zGD10_#g^O zdFmu*zLJHsx-_l`x0&j2iwZSST1HakbO(#lMzYPdl~*nGlpL#e8ousp(Q@DK0nO9|BorOQTytdvNQ;57u_Q(Ioo*g9ai<`tlv zGQj0^xNFx)SPigBe?>(#=WQS?SQ)6{yk;BFSY54zqArVg8{xPq1<}CCdTc)2_f7Xz zmZ3SpKm)Gb(FHCju%WS0G**ho9sasXpLoH6n^ff`R2%N;`RL-4IO3opV$%@s;+0~@ zkU&FiZLq4|M;E5VuZNWR>wHovZw!gQp(PFup$j7-qe8rg%D1K5Q|qr0?J2cE@k)vm z_GAil6cpb`tr1V8(seg+zn%I^yls~p+Z-jq;)eBN8#s#xhrkBJ_lDHtPMmmVNTAGL zE1nyIJBYP)V*e148Wf+|AQJjx%Mdg|v=0#}8$@#oZngbvNUCVdw)ske&`WirxE~kt z6D}W$=Tqv$p_CH3gl65M6B|=YD}<4nDw=a~KeQJoMk%;hS6eUMQu05DUwUg^f#iG2 z>jP!J`f7DmPaI33+lu0SDti;kZY#oTC%t-b<20qAuFRtRQEG4l#G*z%3L%^ErKr?c zHjNZm%E8p?8dX50ypu}z>%?~HeEdmGpmi%(L~KDtD=*^XN1R;9StPIn!}Ry&xl z1!bF$$bGn~S|R?^4z=#LlUo1F&T9R=UCM&r-%F9Y?63#HuN%eN{V3T@uO52!(yO@` zS98e_p!GiD_7CQEuj;q0kZ)Tt=yuYpn_j*2Y7XGlMz5YAUfW7>vwY{hIDbp=gU2oh z8=rW0h+VXWkeXUvg%S9M1J>vh2OYRGCr&x+qL=fo5Fa|`h)*4}MIX|(ZL)z^`(}Fg z^1H2-;BJ2R>IApFNAJh@y_4U&`Q6U%m-*er?{0n{O^1TjA~^nV)UtD}1)X*I^uyybBcGuJCIW-h+We`70Ejw?^V?6yB!rVug!a zWqz5$-3qT#_#%bhqwqY1->dMI3g1FFz6SJgjpX+o!tn*V-c1sJRN+Sz{-nbD6i#0j zCwkE$>EBRzn!?{zc!t7{C_Gc)4u>p1TH)gr?pAoV!lx+wT7~B*oUGV|TYxVs`RTiW zE?WlPQXaa5PT%u&7f5`v!h4rUe73?f7E64Qm9OmOT7|DvzE$D)(hl=`m~hCqvqs{ND7;JI zk1Kk*7Yb1P)WTJH`h7lXPn)8r|D{6w4k`RKh4(1@Erst^_`8H7WLzQn|5@SdW=Q;m z!t?N(EdWIZ44CM9)ODZzde_cPsh6r1EPN z|5D(no@SY@`ew-m*{!fzdz9jrq z5)L0Gp*;N{L_ELDBz#;FepwPeJqe$egwwzHjOPzONZgKa2ZA4=7$JaAf)GTYul}z` zpzo`fBYYX*PJ{}CN(7o;su9q=g65(xA;4J@>k#fj_*e3G3m?kl-)d0~ ztVCnpE0>7--cB6OJ}J?2wsKk-Pj;n|C^riL*yTqoeN+H)mjHnG5r}CM5zQrp8Yz>p z9a6!niMDaT zprL5(>8MJ^*H=^*`zx3U?>zC{B`%E3G|~72fnbeHp%V&9D#llu7$^yra$Fg#_cKt1 zO)n^F@Z~y+S-J|^90CcH1p{2Z-d|k7DJZT8YcXxWt}u_F@cQcdY66gLfpzuO5YWf! z#F@g~iX}IINJ%r;@)9J!*+vPnwuA)ieqj%w3Q)37!e!Mst+7U}ufktfuNsX#YMjcG nG6FRu5?EDnSqYcmP{I;G&JopBzF@V~l9fS{!GbnmqQ>*TKNwQ= literal 0 HcmV?d00001 diff --git a/interpreter/makefile b/interpreter/makefile new file mode 100755 index 0000000..d5b9ffa --- /dev/null +++ b/interpreter/makefile @@ -0,0 +1,14 @@ +SRCC:= ./src/*.c + +all: interpreter + +interpreter: ./src/interpreter.y ./src/interpreter.l ./src/instructions.c + yacc -d ./src/interpreter.y + lex ./src/interpreter.l + gcc lex.yy.c y.tab.c ./src/instructions.c -Isrc -o interpreter + +run: interpreter + ./interpreter < input.txt + +clean: + rm -f lex.yy.c interpreter y.tab.h y.tab.c *.o diff --git a/interpreter/src/instructions.c b/interpreter/src/instructions.c new file mode 100755 index 0000000..734593f --- /dev/null +++ b/interpreter/src/instructions.c @@ -0,0 +1,196 @@ +#include +#include "instructions.h" + +int EBP = 0; + +struct instruction { + char ins; + int arg1; + int arg2; + int arg3; +}; + +struct instruction instructions[MAX_INSTRUCTIONS_SIZE]; +int current_line; +int has_error; + +int memory[MAX_MEMORY_SIZE]; + +int exec(int ip); +int valid_memory_addr(int address); + +/***** Public funciton *****/ + +void asm_init() { + current_line = 0; + has_error = 0; +} + +void asm_add_3(char ins, int arg1, int arg2, int arg3) { + if (current_line >= MAX_INSTRUCTIONS_SIZE) { + fprintf(stderr, "ERROR readfile : Too much instructions, please modify value of MAX_INSTRUCTIONS_SIZE.\n"); + has_error = 1; + return; + } + + // ip are validated at runtime; memory addr are validated here + if (ins == AFC || ins == JMF) { + if (!valid_memory_addr(arg1)) { + fprintf(stderr, "ERROR readfile : INVALID addr at line %d, please verify that addr is in range 0 to MAX_MEMORY_SIZE\n", current_line); + has_error = 1; + return; + } + } else if (ins == JMP) { + // do nothing + } else { + if (!(valid_memory_addr(arg1) && valid_memory_addr(arg2) + && valid_memory_addr(arg3))) { + fprintf(stderr, "ERROR readfile : INVALID addr at line %d, please verify that addr is in range 0 to MAX_MEMORY_SIZE\n", current_line); + has_error = 1; + return; + } + } + + // When OK + instructions[current_line].ins = ins; + instructions[current_line].arg1 = arg1; + instructions[current_line].arg2 = arg2; + instructions[current_line].arg3 = arg3; + current_line++; +} + +void asm_add_2(char ins, int arg1, int arg2) { + asm_add_3(ins, arg1, arg2, 0); +} + +void asm_add_1(char ins, int arg1) { + asm_add_3(ins, arg1, 0, 0); +} + +void asm_run() { + int ip = 0; + if (has_error) { + fprintf(stderr, "ERROR run : abandoned due to previous error.\n"); + return; + } + printf("INFO run : begin\n"); + while (ip >= 0 && ip < current_line) { + // wait for user input + //getchar(); + // execution + ip = exec(ip); + } + printf("INFO run : end\n"); +} + +/***** Private funciton *****/ + +int valid_memory_addr(int addr) { + return addr >= 0 && addr < MAX_MEMORY_SIZE; +} + +int exec(int ip) { + int next_ip = ip + 1; + char ins = instructions[ip].ins; + int arg1 = instructions[ip].arg1; + int arg2 = instructions[ip].arg2; + int arg3 = instructions[ip].arg3; + printf("%d : ", ip); + + // execute inst + switch (ins) { + case ADD: + printf("ADD @%d = @%d[%d] + @%d[%d]\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] + memory[arg3]; break; + case MUL: + printf("MUL @%d = @%d[%d] * @%d[%d]\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] * memory[arg3]; break; + case SOU: + printf("SOU @%d = @%d[%d] - @%d[%d]\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] - memory[arg3]; break; + case DIV: + printf("DIV @%d = @%d[%d] / @%d[%d]\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] / memory[arg3]; break; + case COP: + printf("COP @%d = @%d[%d]\n", arg1, arg2, memory[arg2 + EBP]); + memory[arg1 + EBP] = memory[arg2]; break; + case AFC: + printf("AFC @%d = %d\n", arg1, arg2); + memory[arg1] = arg2; break; + case JMP: + printf("JMP to %d\n", arg1); + next_ip = arg1; break; + case JMF: + printf("JMF cond@%d[%d] to %d\n", arg1, memory[arg1 + EBP], arg2); + if (memory[arg1 + EBP] == 0) next_ip = arg2; + break; + case LT: + printf("LT @%d = @%d[%d] < @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] < memory[arg3] ? 1 : 0; + break; + case GT: + printf("GT @%d = @%d[%d] > @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] > memory[arg3] ? 1 : 0; + break; + case LTE: + printf("LTE @%d = @%d[%d] <= @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] <= memory[arg3] ? 1 : 0; + break; + case GTE: + printf("GTE @%d = @%d[%d] >= @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] >= memory[arg3] ? 1 : 0; + break; + case EQ: + printf("EQ @%d = @%d[%d] == @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] == memory[arg3] ? 1 : 0; + break; + case NEQ: + printf("NEQ @%d = @%d[%d] != @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] != memory[arg3] ? 1 : 0; + break; + case PRI: + printf("PRI @%d[%d]\n", arg1, memory[arg1]); + break; + case AND: + printf("AND @%d = @%d[%d] && @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] && memory[arg3] ? 1 : 0; + break; + case OR: + printf("OR @%d = @%d[%d] || @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2], arg3, memory[arg3]); + memory[arg1] = memory[arg2] || memory[arg3] ? 1 : 0; + break; + case NOT: + printf("OR @%d = ! @%d[%d] ? 1 : 0\n", arg1, arg2, memory[arg2]); + memory[arg1] = ! memory[arg2] ? 1 : 0; + break; + case LEA: + printf("LEA @%d = %d\n", arg1, arg2 + EBP); + memory[arg1 + EBP] = arg2 + EBP; + break; + case COP_LD: + printf("COP_LD @%d = @%d[%d]\n", arg1, arg2, memory[arg2]); + memory[arg1] = memory[memory[arg2]]; + break; + case COP_STR: + printf("COP_STR @%d = @%d[%d]\n", arg1, arg2, memory[arg2]); + memory[memory[arg1]] = memory[arg2]; + break; + case RET: + printf("RET @%d[%d] \n", arg1, memory[arg1 + EBP]); + if (EBP != 0){ + next_ip = memory[EBP - 2]; + EBP = memory[EBP - 1]; + } + break; + case CALL: + memory[EBP + arg2 - 1] = EBP; + memory[EBP + arg2 - 2] = next_ip; + next_ip = arg1; + EBP += arg2; + break; + default: + fprintf(stderr, "ERROR run : unknown inst.\n"); + } + + return next_ip; +} diff --git a/interpreter/src/instructions.h b/interpreter/src/instructions.h new file mode 100644 index 0000000..d87b1b1 --- /dev/null +++ b/interpreter/src/instructions.h @@ -0,0 +1,38 @@ +#ifndef __INSTRUCTIONS_H__ +#define __INSTRUCTIONS_H__ + +#define ADD 1 +#define MUL 2 +#define SOU 3 +#define DIV 4 +#define COP 5 +#define AFC 6 +#define JMP 7 +#define JMF 8 +#define LT 9 +#define GT 10 +#define EQ 11 +#define PRI 12 +#define LTE 13 +#define GTE 14 +#define NEQ 15 +#define AND 16 +#define OR 17 +#define NOT 18 +#define LEA 19 +#define COP_LD 20 +#define COP_STR 21 +#define CALL 22 +#define RET 23 + + +#define MAX_INSTRUCTIONS_SIZE 256 +#define MAX_MEMORY_SIZE 256 + +void asm_init(); +void asm_add_3(char ins, int arg1, int arg2, int arg3); +void asm_add_2(char ins, int arg1, int arg2); +void asm_add_1(char ins, int arg1); +void asm_run(); + +#endif // #ifndef __INSTRUCTIONS_H__ diff --git a/interpreter/src/interpreter.l b/interpreter/src/interpreter.l new file mode 100755 index 0000000..5b65e79 --- /dev/null +++ b/interpreter/src/interpreter.l @@ -0,0 +1,53 @@ +%{ + #include "y.tab.h" +%} + +vSEP [ \t\r\n] + +%% + +ADD {return tADD;} +MUL {return tMUL;} +SOU {return tSOU;} +DIV {return tDIV;} +COP {return tCOP;} +AFC {return tAFC;} +JMP {return tJMP;} +JMF {return tJMF;} +LT {return tLT;} +LTE {return tLTE;} +GT {return tGT;} +GTE {return tGTE;} +EQ {return tEQ;} +NEQ {return tNEQ;} +PRI {return tPRI;} +AND {return tAND;} +OR {return tOR;} +NOT {return tNOT;} +RET {return tRET;} +LEA {return tLEA;} +COP_LD {return tCOP_LD;} +COP_STR {return tCOP_STR;} +CALL {return tCALL;} + +"[" {return tOB;} +"]" {return tCB;} + + +-?[0-9]+ { + yylval.nb = atoi(yytext); + return tNB; + } + + +{vSEP} {} + +. { + fprintf(stderr, "ERROR lex : Unknown pattern %s", yytext); + exit(1); + } + +%% + +int yywrap(void) { return 1; } +//int main(int argc, char *argv[]) { while (yylex()!=0) ; return 0; } diff --git a/interpreter/src/interpreter.y b/interpreter/src/interpreter.y new file mode 100755 index 0000000..c17e301 --- /dev/null +++ b/interpreter/src/interpreter.y @@ -0,0 +1,97 @@ +%{ + #include + #include "instructions.h" + int yylex(); + void yyerror(char*); + int yydebug = 1; + extern int yylineno; +%} + +/* Union for yylval */ +%union { + int nb; +} + +%token tADD tMUL tSOU tDIV tCOP tAFC tJMP tJMF tPRI tRET tCALL +%token tLT tLTE tGT tGTE tEQ tNEQ tAND tOR tNOT +%token tLEA tCOP_LD tCOP_STR +%token tOB tCB +%token tNB + +%% + +%start File; + +File: + Instructions; + +Instructions: + /* epsilon */ + | Instructions Instruction + ; + +Instruction: + tADD tNB tNB tNB + {asm_add_3(ADD, $2, $3, $4);} + | tMUL tNB tNB tNB + {asm_add_3(MUL, $2, $3, $4);} + | tSOU tNB tNB tNB + {asm_add_3(SOU, $2, $3, $4);} + | tDIV tNB tNB tNB + {asm_add_3(DIV, $2, $3, $4);} + | tCOP tNB tNB + {asm_add_2(COP, $2, $3);} + | tAFC tNB tNB + {asm_add_2(AFC, $2, $3);} + | tJMP tNB + {asm_add_1(JMP, $2);} + | tJMF tNB tNB + {asm_add_2(JMF, $2, $3);} + | tLT tNB tNB tNB + {asm_add_3(LT, $2, $3, $4);} + | tGT tNB tNB tNB + {asm_add_3(GT, $2, $3, $4);} + | tLTE tNB tNB tNB + {asm_add_3(LTE, $2, $3, $4);} + | tGTE tNB tNB tNB + {asm_add_3(GTE, $2, $3, $4);} + | tAND tNB tNB tNB + {asm_add_3(AND, $2, $3, $4);} + | tOR tNB tNB tNB + {asm_add_3(OR, $2, $3, $4);} + | tEQ tNB tNB tNB + {asm_add_3(EQ, $2, $3, $4);} + | tNEQ tNB tNB tNB + {asm_add_3(NEQ, $2, $3, $4);} + | tNOT tNB tNB + {asm_add_2(NOT, $2, $3);} + | tPRI tNB + {asm_add_1(PRI, $2);} + | tLEA tNB tNB + {asm_add_2(LEA, $2, $3);} + | tCOP_LD tNB tOB tNB tCB + {asm_add_2(COP_LD, $2, $4);} + | tCOP_STR tOB tNB tCB tNB + {asm_add_2(COP_STR, $3, $5);} + | tRET tNB + {asm_add_1(RET, $2);} + | tCALL tNB tNB + {asm_add_2(CALL, $2, $3);} + ; + + +%% + +void yyerror(char* str) { + extern int yylineno; + fprintf(stderr, "ERROR yyparse : Line %d: %s\n", yylineno, str); +} + +int main(int argc, char *argv[]) { + asm_init(); + yyparse(); + printf("INFO yyparse : Parsing End\n"); + asm_run(); + return 0; +} + diff --git a/lex.yy.c b/lex.yy.c deleted file mode 100644 index 5c3013a..0000000 --- a/lex.yy.c +++ /dev/null @@ -1,1958 +0,0 @@ - -#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 35 -#define YY_END_OF_BUFFER 36 -/* 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[70] = - { 0, - 0, 0, 36, 35, 10, 11, 20, 30, 5, 6, - 3, 1, 12, 2, 4, 32, 9, 16, 13, 17, - 34, 34, 34, 34, 34, 34, 34, 34, 7, 35, - 8, 15, 26, 32, 34, 34, 18, 14, 19, 34, - 34, 27, 34, 34, 34, 34, 34, 25, 33, 34, - 34, 22, 34, 34, 34, 34, 34, 28, 21, 34, - 34, 34, 31, 34, 34, 29, 23, 24, 0 - } ; - -static const YY_CHAR yy_ec[256] = - { 0, - 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 4, 5, 1, 1, 1, 1, 6, 1, 7, - 8, 9, 10, 11, 12, 1, 13, 14, 14, 14, - 14, 14, 14, 14, 14, 14, 14, 1, 15, 16, - 17, 18, 1, 1, 19, 19, 19, 19, 19, 19, - 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, - 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, - 1, 1, 1, 1, 19, 1, 20, 19, 21, 19, - - 22, 23, 19, 24, 25, 19, 19, 26, 27, 28, - 29, 30, 19, 31, 32, 33, 34, 19, 35, 19, - 19, 19, 36, 37, 38, 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[39] = - { 0, - 1, 1, 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[71] = - { 0, - 0, 0, 79, 80, 80, 80, 61, 71, 80, 80, - 80, 80, 80, 80, 80, 25, 80, 59, 58, 57, - 0, 44, 46, 17, 51, 39, 47, 44, 80, 30, - 80, 80, 80, 27, 0, 52, 80, 80, 80, 37, - 32, 0, 30, 37, 36, 27, 34, 80, 44, 25, - 34, 0, 27, 26, 19, 26, 18, 0, 0, 17, - 17, 24, 0, 21, 15, 0, 0, 0, 80, 40 - } ; - -static const flex_int16_t yy_def[71] = - { 0, - 69, 1, 69, 69, 69, 69, 69, 69, 69, 69, - 69, 69, 69, 69, 69, 70, 69, 69, 69, 69, - 70, 70, 70, 70, 70, 70, 70, 70, 69, 69, - 69, 69, 69, 70, 70, 70, 69, 69, 69, 70, - 70, 70, 70, 70, 70, 70, 70, 69, 70, 70, - 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, - 70, 70, 70, 70, 70, 70, 70, 70, 0, 69 - } ; - -static const flex_int16_t yy_nxt[119] = - { 0, - 4, 5, 6, 5, 7, 8, 9, 10, 11, 12, - 13, 14, 15, 16, 17, 18, 19, 20, 21, 21, - 22, 23, 21, 21, 24, 21, 25, 21, 21, 26, - 27, 21, 21, 21, 28, 29, 30, 31, 34, 42, - 34, 35, 68, 67, 43, 66, 36, 65, 36, 64, - 63, 62, 61, 60, 59, 58, 57, 49, 56, 55, - 54, 53, 52, 51, 50, 49, 48, 47, 46, 45, - 44, 41, 40, 39, 38, 37, 33, 32, 69, 3, - 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, - 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, - - 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, - 69, 69, 69, 69, 69, 69, 69, 69 - } ; - -static const flex_int16_t yy_chk[119] = - { 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, 1, 1, 16, 24, - 34, 70, 65, 64, 24, 62, 16, 61, 34, 60, - 57, 56, 55, 54, 53, 51, 50, 49, 47, 46, - 45, 44, 43, 41, 40, 36, 30, 28, 27, 26, - 25, 23, 22, 20, 19, 18, 8, 7, 3, 69, - 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, - 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, - - 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, - 69, 69, 69, 69, 69, 69, 69, 69 - } ; - -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 "analyse_lexicale.lex" -#line 2 "analyse_lexicale.lex" -#include "analyse_syntaxique.tab.h" -int yywrap(void){ - return 1; -} - -#line 492 "lex.yy.c" -#line 493 "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 54 "analyse_lexicale.lex" - - -#line 713 "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 >= 70 ) - 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] != 80 ); - -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 56 "analyse_lexicale.lex" -{return tADD ;} - YY_BREAK -case 2: -YY_RULE_SETUP -#line 57 "analyse_lexicale.lex" -{return tSUB ;} - YY_BREAK -case 3: -YY_RULE_SETUP -#line 58 "analyse_lexicale.lex" -{return tMUL ;} - YY_BREAK -case 4: -YY_RULE_SETUP -#line 59 "analyse_lexicale.lex" -{return tDIV ;} - YY_BREAK -case 5: -YY_RULE_SETUP -#line 61 "analyse_lexicale.lex" -{return tPO ;} - YY_BREAK -case 6: -YY_RULE_SETUP -#line 62 "analyse_lexicale.lex" -{return tPF ;} - YY_BREAK -case 7: -YY_RULE_SETUP -#line 63 "analyse_lexicale.lex" -{return tAO ;} - YY_BREAK -case 8: -YY_RULE_SETUP -#line 64 "analyse_lexicale.lex" -{return tAF ;} - YY_BREAK -case 9: -YY_RULE_SETUP -#line 66 "analyse_lexicale.lex" -{return tPV ;} - YY_BREAK -case 10: -YY_RULE_SETUP -#line 67 "analyse_lexicale.lex" -{} - YY_BREAK -case 11: -/* rule 11 can match eol */ -YY_RULE_SETUP -#line 68 "analyse_lexicale.lex" -{} - YY_BREAK -case 12: -YY_RULE_SETUP -#line 69 "analyse_lexicale.lex" -{return tVIRGULE ;} - YY_BREAK -case 13: -YY_RULE_SETUP -#line 71 "analyse_lexicale.lex" -{return tAFFECTATION ;} - YY_BREAK -case 14: -YY_RULE_SETUP -#line 73 "analyse_lexicale.lex" -{return tEGAL ;} - YY_BREAK -case 15: -YY_RULE_SETUP -#line 74 "analyse_lexicale.lex" -{return tDIFF ;} - YY_BREAK -case 16: -YY_RULE_SETUP -#line 75 "analyse_lexicale.lex" -{return tLT ;} - YY_BREAK -case 17: -YY_RULE_SETUP -#line 76 "analyse_lexicale.lex" -{return tGT ;} - YY_BREAK -case 18: -YY_RULE_SETUP -#line 77 "analyse_lexicale.lex" -{return tLTE ;} - YY_BREAK -case 19: -YY_RULE_SETUP -#line 78 "analyse_lexicale.lex" -{return tGTE ;} - YY_BREAK -case 20: -YY_RULE_SETUP -#line 79 "analyse_lexicale.lex" -{return tNOT ;} - YY_BREAK -case 21: -YY_RULE_SETUP -#line 82 "analyse_lexicale.lex" -{return tMAIN ;} - YY_BREAK -case 22: -YY_RULE_SETUP -#line 83 "analyse_lexicale.lex" -{return tINT ;} - YY_BREAK -case 23: -YY_RULE_SETUP -#line 84 "analyse_lexicale.lex" -{return tPRINT ;} - YY_BREAK -case 24: -YY_RULE_SETUP -#line 85 "analyse_lexicale.lex" -{return tRETURN ;} - YY_BREAK -case 25: -YY_RULE_SETUP -#line 87 "analyse_lexicale.lex" -{return tOR ;} - YY_BREAK -case 26: -YY_RULE_SETUP -#line 88 "analyse_lexicale.lex" -{return tAND ;} - YY_BREAK -case 27: -YY_RULE_SETUP -#line 90 "analyse_lexicale.lex" -{return tIF ;} - YY_BREAK -case 28: -YY_RULE_SETUP -#line 91 "analyse_lexicale.lex" -{return tELSE ;} - YY_BREAK -case 29: -YY_RULE_SETUP -#line 92 "analyse_lexicale.lex" -{return tWHILE ;} - YY_BREAK -case 30: -YY_RULE_SETUP -#line 94 "analyse_lexicale.lex" -{return tAPPERSAND;} - YY_BREAK -case 31: -YY_RULE_SETUP -#line 95 "analyse_lexicale.lex" -{return tCONST ;} - YY_BREAK -case 32: -YY_RULE_SETUP -#line 96 "analyse_lexicale.lex" -{yylval.nombre = atoi(yytext); return tENTIER ;} - YY_BREAK -case 33: -YY_RULE_SETUP -#line 97 "analyse_lexicale.lex" -{yylval.nombre = -1; return tENTIEREXP;} - YY_BREAK -case 34: -YY_RULE_SETUP -#line 98 "analyse_lexicale.lex" -{strcpy(yylval.id, yytext); return tVAR ;} - YY_BREAK -case 35: -YY_RULE_SETUP -#line 100 "analyse_lexicale.lex" -ECHO; - YY_BREAK -#line 946 "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 >= 70 ) - 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 >= 70 ) - yy_c = yy_meta[yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; - yy_is_jam = (yy_current_state == 69); - - 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 100 "analyse_lexicale.lex" - - -//int main(void){ -// yylex(); -//} - - - diff --git a/script.sh b/script.sh index 8878453..dabaea4 100755 --- a/script.sh +++ b/script.sh @@ -2,17 +2,20 @@ bison -d -t analyse_syntaxique.y -v flex analyse_lexicale.lex gcc -w *.c -ly echo " - int fonction1(int a){ - int b = 4; + int fonction1(int * a){ + int b = *a; + printf(b); return 1; } int main(){ - int c = 2; - int * p; + int l = 21; + int * p = &l; + int c = fonction1(p); + printf(c); p = &c; *p = 2; - int b = *p; + printf(c); return 0; } diff --git a/table_symboles.c b/table_symboles.c index b9e58e5..31f4899 100644 --- a/table_symboles.c +++ b/table_symboles.c @@ -82,7 +82,6 @@ void free_temp(Table_Symboles * table){ int prepare_function_call(Table_Symboles * table){ prepare_argument_push(table); prepare_argument_push(table); - prepare_argument_push(table); } int prepare_argument_push(Table_Symboles * table){ diff --git a/table_symboles.h b/table_symboles.h index e03b52a..0eac03f 100644 --- a/table_symboles.h +++ b/table_symboles.h @@ -1,7 +1,7 @@ #ifndef TABLE_SYMBOLES_H #define TABLE_SYMBOLES_H -#define TABLE_SIZE 50 +#define TABLE_SIZE 256 #define VARIABLE_SIZE 30 enum Symbole_Type {TYPE_INT , TYPE_CONST_INT, TYPE_INT_PTR}; diff --git a/test_file b/test_file new file mode 100644 index 0000000..f0dfdca --- /dev/null +++ b/test_file @@ -0,0 +1,16 @@ +int fonction1(int * a){ + int b = *a; + printf(b); + return 1; + } + +int main(){ + int l = 21; + int * p = &l; + int c = fonction1(p); + printf(c); + p = &c; + *p = 2; + printf(c); + + return 0; \ No newline at end of file diff --git a/xilinx/.DS_Store b/xilinx/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..15f11d24cc626205b1223eef6ac354aa4353d98a GIT binary patch literal 6148 zcmeHK-A)rh6rL$XwngmnCx|iG*qD&O1*9k@hOjOeZPZZNimiZUw;jrcWvAKQQlZxL z6};5M2jCe@yw)f1%J>L+>y@7Qsr>1MH^z`X$;@}=%sFTFeETyy2qA3LE7J(62q6U; z!*~+9-w2y$?Ucl%r5g~l9JFk^)P@mD7fHlG#K8Z~0DE`4&~5YpJJyH2#k3_DM+{IN`cXD$fp0`MnzW3>_MHy1PCh9?!S5xfzhKa6~Vb)KpORsq5xw z;DiqKifaLoo(;)P*4w18;x3T9RAW=Y3h@KLQ!$02<@=UbCC1*mYuUtI@(db=bf@5y zsVA;H#nZwt=M$DPJ^xK`nAY!ilyRY`C@mC((t5kVbw$N_k9s7L)^lPq0XxeCJbn++ z3fe~d=oNa44$wRF0ewba(RbW~ReTjs;2AuJ=kY!K2ruJ2F5;)SEE2>z_w-63c5qs$gN>F=U|S6A$|V*pEK!Fg*JrsZ)B-eyLG~5d#qef5`y*K4{Pw>Jr-m z`KJRqegpuFgP9BH{O2D~V+KH7Vp||sK(Gh}6roriF|a&4U=a@Uy7X@g6yXT-l_8H@ z8Osw2mPZe)ad(7ufl(hZ5HWC^fi5vr+5Ug$&*%T+LD48;AY$N5F@WQX=Ar>5$-VVd zacr;Eplv{7!u;9-c?fiJJLU@8ibtVwfjNySfV#xCK(K&BKLVVFsEZi*rwsfAX_wz$ literal 0 HcmV?d00001