./ 755 0 0 0 7441017514 4060 ./bin/ 755 0 0 0 7441023741 4627 ./bin/bison 755 0 0 320000 7441023732 6007 8 __PAGEZERO __TEXT __text __TEXT ' < __fvmlib_init0 __TEXT ld P lD __fvmlib_init1 __TEXT e E __cstring __TEXT e 0 E __const __TEXT l v __literal8 __TEXT __DATA __data __DATA __bss __DATA __common __DATA 0 8 __LINKEDIT 0 > /usr/shlib/libsys_s.B.shlib P ' UWVSu F Ǎ^~ t u9 w a = tЃ= tЃ=4 t =0 t SW6V\ PU]UEld }e sEPE
E䐐]U WVS1P L Pj! E f8 t#f Pj \ 9 L =T }= }]= }E}<}1U}f8 |h+EEEp}T P9E'+MyA }) } FT f
}9] ~1u ^9E~ @ f}fWB@ C9] ء@ }Ћufh h( ~)hOh h( v~WhQh h( _ (
( ( |
B
Bcz }9B ~B
RB P
h( j
E05t hch h( h( WVP=D tAu=hph 5t ud D Ph uyh Rh( e[^_ UHWVS1u 9}L F9| M IDE1fx U L ~Ph g h( T P f; ~)X 4hf h( f; Phdi h( ` f> G9=L Lh( hf Be[^_ U WVS5` j. =\ )UD @Pj E D ~6= }}|7 t7}fY K5` j =\ )T D ` Pj \ 9 L ~:}4T tfAf ufC9 L ̃= t=\ Et P} tue[^_ U\ T t P
\ T tP UWVSu }1щKщJ9v1VE)Pt% e[^_UWVS]u 1҉щMT
UR SW VR e[^_ UWVSpi 5p t@1҉щMT
UR SW 5p c1щM=| ҋ= E)ȍTUR= SWT 5| VF 5 V8 ? t'X t
u_F> uމe[^_UVSuu VÃuVhwi 5j ؍e[^ USEt$PsÃuhi 5j ؋]UWVS]hi u {ǃS s)WPj9uK(CS !S C)KM)9~MK C CVW^e[^_ UWVShi uE F^ )Whi uWhi uuSj^V 9uN(F!V F)NM)9~MN F FSWhi uW ue[^_ UuuE UWVSE E]U1щMQ }8Uu EFE8 u ȍe[^_ US]jcjyS jCjYP jhjySq $jHjYP_ ] US]S jhjcS8 jHjCP) ] UWVSu }]u- j.P t=+~4jhi BPa tjhi PHu e[^_ UWS\ EPEPEPR` \ 1щMJ}tщH)RS | =\ 1щJ}u }t1щH)R5\ U R ` tR= thi ! \EPEPEP5t u t 1щMJ}tщH)RS = 1щȃP^ | hi 5 Re RZ EPEPEP5t Ut= uR>e[_ U(= u
i = u
i =p u5 5| p =l uhi 5 gl hi 5 Oh hi 5 :x 5 P)x Uhi 5t ]X hs$ h8J j j h | hs$ h8J j j h d 0hs$ h8J j j h I hs$ h8J j j h 1 (hs$ h8J j j hP hs$ h8J j j h U5X U\ tPh 5 5| 3Ph 1PR = t5p 4 1PRc = t hi 5 Ph 1PR+ =| t\5x h W 1PR hi 5 w5 PkPhP P 1PR US]Shj | C
C+{ }9C ~C
SC PSj
5p hj S? |
C
C-{ }9C ~C
SC PSj
5Sh k | C
C+{ }9C ~C
SC PSj
Shk | C
C+{ }9C ~C
SC PSj
Sh3l c | C
C+{ }9C ~C
SC PSj
QShm | C
C+{ }9C ~C
SC PSj
Sh.o ] US]hSo hXo S |C
C.{ }9C ~C
SC PSj
|
C
C-{ }9C ~C
SC PSj
YShmo Sho ] UVS]u j h 5 VSh < y $ h j Ah j - l 놐 u e p K 9 )hXp h^p \ ` d 5p hzp h( j2 9u 5p hp h( |j C9}45p hp h( T t e[^ UVSuVhp 61ۃ f8 t?f } tXE@Pj }1Ƀ9M~"UЋ]u}ЋffJA9M硬 u}fxEu95 } t u貳} t u衳5 5 e[^_ US5 1ۃ9 ~ t PQC9 ⡬ tP6] U WVSH @1f| 5 u5x u5 u}uu萐 tQuuu +EE19M~(UCEuu A9MuˋuuuGH @D9|H @1f| ~; tt P3uGH @D9|ǡ t P tPe[^_ U\ B }B> k/zUhs$ h8J j j hк , Uк 1PRw UWVSX
8 R_ÐC&0 $p X
xBBR'Ã*t/theq 밃/X
x
BB
Rþ uD*u?X
xBBR诬Ã*t/uZ1X
y5A
ul tuhq M#X
xBBRKÅel BB؍e[^_ USU
x
BB
RÃu
hq ؋] U WVSEDž 5X Ã
u,hq b5X SO? Dž \t#9 Dž 5X 1Ãtu { nu
k au [ ru
K fu ; bu + vu \t
't"u Vhq CЃw,1tЁ w5X uÃCЃv~x 5X P1CЃ w t3#Cw t3Cw4t3Ɂ w5X 벐Vhq 5X S豸5f r fP Ph r ? 9u t \u B 'u \B "u \B F^w u\Bt
u \Bnz
u \Brj u \BvZu \BbJ u \Bf:\BB}^?0B}^$ 0$ 0B } tL 1щKEx 9xs
SP SEp 袯}_ E 04[^_ UE, $ 4 ( 0 UWVS}Qhsr WS輶 Zu
hMr
tѾк F @9Fs jV F F x GG W裧Ã>uк C @9CsjS C C sS 9uK(C!S C){)9~{ C C5$ e[^_ UWVS$ , t'0 ( 4 $ , sƍF}I $ $ r к C @9Cs jS C C X
x B0B R胦X u_t.tк C @9Cs jS C C {S 9uK(C!S C)KM)9~MK C C=$ 5X V´5$ B ( ĺ X t]к C @9Cs jS C C ĺ DFУĺ X
x B0B RX uк C @9Cs jS C C {S 9uK(C!S C)KM)9~MK C C=$ 5X Vȳ к C @9Cs jS C 'C j'EPS X
x
B0B
R諤ƃ't!hr b]j'Sj uк C @9Cs jS C 'C C @9Cs jS C C sS 9uK(C!S C){)9~{ C C5$ VO ( B fzEfBк C @9Cs jS C "C ]j"Shк ƃ uк C @9Cs jS C C sS 9uK(C!S C){)9~{ C C5$ V膪 ( @ 8$ Oh $ r $ r $ r $ r к C @9Cs jS C C X
xB0BRƿк G @9Gs jW G G
ul t
t tC @9Cs jSa C C KMS 9uK(C!S C)KM)9~MK G GM
$ {u 5X V聰 5X ~к C @9Cs jS C C C @9CsjS C C sS 9uK(C!S C){)9~{ C C5$ e[^_ U WVS1ۉ]]X
x
BB
Rߠþк F @9Fs jV F %F F @9Fs jV F F 2f %t?0 ) = < > {tN ^V 9uN(F!V F)N)lj9~N F F $ ^V 9uN(F!V F)N)lj9~N F F $ J ^V 9uN(F!V F)N)lj9~N F F $ ^V 9uN(F!V F)N)lj9~N F F $ ^V 9uN(F!V F)N)lj9~N F F $ r ^V 9uN(F!V F)N)lj9~N F F $
* ^V 9uN(F!V F)N)lj9~N F F $ X uKк qQ 9uI(A!Q A)Y)lj9~Y A A5$ X
xBBRX u
_t
-u._u- к F @9Fs jV F F 띐= к C @9Cs jS C C X
x BB RWÃ"u[ܺ +غ Ej"EPj [ t7к C @9Cs jSJ S EC Ɛ5X S蹫к C @9Cs jS C C sS 9uK(C!S C)K)lj9~K C C5$ } tuu8 =8 t 3$ @PTt ; u} t"{t u P5$ h4s Ct w
th CuhRs h h_s hq } t8 uKu C:5$ hes 蠸(CuhRs h h_s hq ` 5$ h^p \䐐Ce[^_ UVSu] p hs j 9l SV7 =d tj薞 肿=d tj^T G 諢 > @_ =d % e[^ UVSuVhs n \ 9 L ~5 s < ts RX 4hs V*C9 L Vhf e[^ U(WVS5` j
ED @Pj E5` j
\ )U` < @Pj E = ths h( 莝5` j +\ }}}] D 9 MME = }؋M| D f ~ Dž 9 @9 s jV F ,F ~A 9 s
SV讹 Sht v 试 ^ Dž PRht 1щO 9 s
WS- Ws - { 9 9 s
VSݸ Vht s ޔ s tmDž pfx tf> u҉R 5 fx t$f f}1ff> u Rhw h t hs S芙 1щO 9 s
WVڷ WSv ߓ ~ Dž 9 @9 s jV~ F ,F ~A 9 s
SVN Sht v O ^ Dž PRht 聘 1щO 9 s
WSͶ Ws ͒ { 9 9 s
VS} Vht s ~ s t
=| u2= u) C 9Cs VS' Vhw s )s [^_ U 0 WVS H ] $)ĉDž 9}25 fT>f9|ݹw H tUQhs S 1щO 9 s
WVK WSv P ~ j hw h t hs S蛖 1щO 9 s
WV WSv ~ Dž 9 @9 s jV蒴 F ,F ~A 9 s
SVb Sht v c ^ Dž PRht 蕕 1щO 9 s
WS Ws { 9 9 s
VS葳 Vht s 蒏s [^_ U`P WVSDž
C 9Cs
VS? Vhqw s @ s D @Pjֱ D C9}65 fD>
f9|ػw D BtYShs V 1K 9 sSh n SV5 p j h x h t hs V踓1K 9 sSh
SV5 Dž 9 @9 sjh 誱 , ~D 9 sSh u Sht 5 s FBPht 讒 1щO 9 s
WS Ws { 9 9 sSh 謰 Sht 5 誌 t6 9 s
Sh Y Shx 5 X = u
= 5\ hx V萑 1K 9 sSh SV5 5` h0x V2 1K 9 sSh 脯 SV5 膋 5D hCx VԐ 1K 9 sSh & SV5 ( 5H hXx Vv 1K 9 sSh Ȯ SV5 ʊ 5 hnx V 1K 9 sSh j SV5 l = u;= u2 + C 9Cs
VS$ Vhx s % s @ C 9Cs
VS Vhx s C Ɖs ) i9Cs
VS Vhx s É s Dž 9L ܯ دDž
X 4tH t?"t\t
t
tu <^v FuK~< C 9Cs
VS߬ Vht s s Dž C @9Cs jS訬 C "C
X 4 x "t\uTPh y ܯ܍ ܯ1щOC 9Cs
WS. Wܯ
u+ C 9Cs
WS Wh y u+ C 9Cs
WS̫ Wh#y u' C 9Cs
WS蜫 Wh&y U<^v\Rh)y د د1щOC 9Cs
WSF Wدs F { # G @9Gs jW W G F~ C 9Cs
VS Vh/y s s 9
L < C 9Cs VS葪 Vh3y s 蓆 { >C = u<= u&G9Cs
VST Vhx s U s = < f9|ٻy D BtYShs V 1K 9 sSh 3 SV5 5 j hy h t hs V}1K 9 sSh Ϧ SV5 т Dž 9 @9 sjh r , ~D 9 sSh = Sht 5 ; FįBPht v 1щO 9 s
WSå Ws Á { 9 9 s
VSs Vht s t s į tį~C @9Cs jS4 C
C D @P蚣 Dž =D 9}_5 ÃNDž fLffHf 9|¡D fLff
< D f By @tYShs V̅ 1K 9 sSh SV5 j hz h t hs Vh1K 9 sSh 躣 SV5 Dž 9 @9 sjh Z , ~D 9 sSh % Sht 5 # FBPht ^ 1щO 9 s
WS諢 Ws ~ { 9 9 s
VS[ Vht s \~ C Ɖs 9Cs jS/ C
C tz tSz[^_U0 WVS54 h
z SM 1щOF 9Fs
WV裡 WSv } ~ h h!z S 1щOB 9Bs
WRS WSv X} ~ 5\ h5z S詂 1щOB 9Bs
WR WSv }~ [^_ UPWVSE }}}\ 9} f F9|E }} }| } } |}D.EN9 =\ }= }=x }܋= }ԋ}}19]~U}}؋}ԉ}}C }؍) }܅t| fpf؋}fEC9]})}N9u~ }L1fy ~OUЋ=\ }̋= } Tqt"R}D9E~}fG9uE FA9|̋ }Lt 19} DqfC F9|} } }| t}} }}ȋu9u~l=\ }= }ču | E1ɋ}؉E9]~ =\ }U9EuAC9]9M} Mȋ}}EF9u} ~,1ۡ\ 9} 9Euf C9|]} u*]\ 9} ¡ f8 uf C9|Ee[^_ UWVS1\ 9} f8 tFB9| Vj聜 ¡ UU]Vjf ¡ щ 19\ ~0 f 6uu ̴ Kx]_uF9}Ky|?_uF9u05 u_uF9E~KxuF9t̴ J9~ WffDWJ9uft_̴ EEEu95ȴ 8e[^_U WVSUȣ PE9H ]XE XEJU = } ]쐡ȣ }4x p9Eue p9EuWE 1ɐ9M~7]}fJf9Hu]fJf9HtE A} uă} FMye[^_UWVSE ȣ MH PEu hz h hz hq E𡴣 UM
д )M 1ۋ}9]~;EE= ~h hz Ąԣ Mf Rh | Pb1҉O 9 sWh W5 \ =
o xC0CߐSkUϐ GW )th-| h hz hq 9 sRh B
GW 9uO(WO!ʉW +WG+G9~ O G G[
tq x C0CSoTՐtw G @9Gs jW O G x C0C S'Tƃ
ut/ G @9Gs jW9 O G th-| h hz hq 芗 SΈ[^_ U WVS= ug5t jƖ R5l h | S,` 1щOF 9Fs
WV~ WSv Z ~ X
xBBRSÃt$ G @9Gs jW.~ G G 뵐[^_ U WVS=| Cs )ƿ G 9Gs
VW} G CS 9uK(SC!S +SK+C9~K C CVY w h !G 5 hA| S^ 1щOF 9Fs
WV-} WSv 2Y ~ =| t[5x j Rhn| Sp^1щOB 9Bs
WR| WSv X ~ t:t R[UuYT t R3U=| t_ t RU= uXO[^_US]j]
Pz fX] U WVSE @HM@ E= t PQh
8 M
@ M} 19u Mq Pf; ~
f; ؉E ]X 4h{| uT T P 9s$X 4h| uS 9ruj.Sf; ~'X 4hf uS f; uh| uSuj
zSF9uuj
cSe[^_ UWVS ] [|}\ ]DEf u,u(} 9=4 u h| h| uR 1]f{ ~iu }f|8 tKL8 IT9\ ~} hF} uPhK} h^} uPE E9D
| X 4D
Puhd} u|P T "u]tYz t Vh? { tshs iYSB z fCfBfC؉Z S
L )u( p 9u ush 3ZMK utf` fC` C u { PWKsh Ytufĺ fC }u P5$ h Yj%\e[^_U=ܵ th h eY]th h IYܵ ( US#t h+ h% Yj%T 5$ !m Ã5X 衏PK% u5$ h( Y趕twt
Du?뱐( B uZ 랐PSIt( ph lXt5$ hO TXj% U] UWVS1ۉ 5X ݎPK%# u5$ h( YǍG $ț 5$ k ƃ ( fx tphz W( f fBMJz urh W( @ tvP up jRVwHt\( ph @WEu( fĺ fB+5$ h 5$ h̀ Wj%E e[^_U WVSDž Dž Dž = th) h V = up5t j} R5l h0 VQG1щK 9 sSh e SV5 A " C @9Cs jSre C
C 1щKF 9Fs
SV;e Sv ;A ^ = tC 1щKF 9Fs
SVd Sv @ ^ X
/tK F @9Fs jVd F F = t! F @9Fs jVd F F {G
t /t# }7
l 5X , @90 s jWd G G t* @9 sjh c x
FF
V8Ã*t/uDž Dž VS"GM , @90 s jWqc G G t#ǡ @9 s jWEc G G xFFV7Ð * , @90 sjh b , , t#ǡ @9 s jWb G G xFFV_7Ã*t/N , @90 s jVhb F F ơ @9 s jV8b F F
ukl , @90 s jWb G G t#ǡ @9 s jWa G G ~ ylxuhq QSo , @90 s jWa G G t#ǡ @9 s jW]a G G xFFV61 uh> hB Q 1щKF 9Fs
SV` Sv < ^ = tC 1щKF 9Fs
SVs` Sv s< ^ 覇Ã;t;5X SC-X
xBBR4ÃP[^_ UWVSM5X S|CX uhO mP X xCCS4¿ 1-uH x
C{
SW4¿%tB x
CC
S+4X uSRBƣD e[^_ UWVS1躌u 5$ c 虌t
5$ hv I ( C s fCiu =ĺ Yu( B8"t5$ h 6Oj%{B r fzZ S
L e[^_ U跅% wk$ Րjjjj뾐뵐/뭐륐띐땐jj jI235$ hʁ hNj% Yuhہ ]OAf r fEUEPn Ph Nj%d U,@ WVS=| tE 5D h P> 1҉KF 9Fs
SV] Sv 9 ^ = ui5t jt R5l h | H>1҉KF 9Fs
SV\ Sv 8 ^ C @9Cs jSo\ C {C Dž X
xBBR0 p
' A" ]
tPa $ L @; / ) {t; C @9Cs jSr[ K C l C @9Cs jS>[ K C X ̹ @9й s jVZ N F u
hH~ yL
u!hk~ SKSWE> ̹ @9й s jVZ N F \u_ x C8C S//ǃu
hH~ K ̹ @9й s jV4Z N F
ul x C8C S.9 ̹ @9й s jSY K } =X ̹ @9й s jSY K C xGGWG.Ã*t/uDž Dž WS< ̹ @9й s jV)Y F F xGGW-Ð u*uz ̹ @9й s jVX F F x GG W-Ã*t/ ̹ @9й s jVX F F -
u?l ̹ @9й s jVRX F F y@Luhq IC ̹ @9й s jVX F F xGGW,1 =X xGGWw,Dž hB A?X
xBB RO# =X P \ @9` s jSWN C C u
hH~ ?
u!hk~ >WS1 P \ @9` s jVM F F \u_x
GG
W"Ãu
hH~ R?P \ @9` s jVM F F
ul xGGW'"9% =X P \ @9` s jS'M C C xGGW!Ã*t/uDž Dž WSZ0 P \ @9` s jVL F F xGGWO!Ð u*uzP \ @9` s jVVL F F x GG W Ã*t/ P \ @9` s jVL F F !
u?l P \ @9` s jVK F F y@Luhq M=CP \ @9` s jVK F F xGGW+ 1Ʌw =X xGGW Dž Wv ~ =| t]@PSh 1щOF 9Fs
WVq> Wv q ~ @F @9FsjV1> F
F [^_ U WVS= I h -= d t[Rh VM 1щK, 90 sSh = SV5, , 2 C 9Cs
VSi= VhDŽ s j s =| 5\ 95L ~} X :@tXVRh 1щOC 9Cs
WS< Ws { F95L [^_ US1ۡ @PjT; ڃ
9
f B9~ C9\ ~lfCf=tbfu h h h hq T C ff@}f}EBx uf@MfD Bf@fD tu} t!ufF}fD;fFfD;fFfD;}fߋMuf= t
h [ w= t- C 9Cs
WS6 Whp v ~ B[^_ UVS]= t* C 9Cs
VS)6 Vh s *s e[^ USUJx' ] M9t1Jy ] UU1Ʌt
B!Au UWVS1] KxE46ǃKye[^_UWVS ET Pff~?5\ 9|&)yA )Ѻ } !tffʸ e[^_ U WVS` B }B>Pj3 E` B }B>X|# } Ky 9 D E }C ) }Pu5 uE= } tPh }= e[^_U(WVSL B }B>Pj42 ED B }B?Pj2 E5T + \ yC )Éػ ߉
! }F )Ɖ߉
L B }B>p|# } Ny 95D j
M= }
\ M= }E }F )Ȼ } M}f f} ff)Éؘ M }MT9 PUff|r9E-+EEy }) Mt+f} ff)Éؘ M E}ff}}F )щʿ M EF95D L B }B>Pu5 uE= } t P M
t Pr }= D B }B?Pu
D )
5\ L 9}>= }؉É}F )щʿ Mt F9|͡ =` )lj=P 95D ~a
M= }ػ MfLfMft+} ff})lj M F95D e[^_U WVS= ~j D 9\
M= }E }C )ȿ M}L7 C9]}e[^_UPj$ D B }B?Pj$ L B }B>Pj$ L B }B>Pj$ ) P }5T + \ yC ) = uX 4hX =P ~8= t1h( 5D 5` 5\ 5t h h( e[^_ U t P t P t P tP USM1Ҁ9 t U 1Љ? A9 uл Ћ] UWVSu] j$" ǡ G V) GG fG fG G fGG G L e[^_ Uh j" UWVSuǡ 1t)suku
ttڅu4Wu
Ã= u
X ؍e[^_UWVS1 t%;Ct Pt SuF ~ơ tPe[^_ UWVSE < }uh̉ h( yh( h։ t19u (
( ( |$KCt
0} u{ }B9C ~9Kt
0 <
tCE= tu uh G E ] 9] }}萐E ] 9] }}]]쐋E} }M) ]tQ19u ~J]}F E}) ً} t]}Ћ] F9u }}E] 9]p}}E] 9];= tu uh
Je[^_ UWVSE yE >Eu u19] ~Aމ}C M M})ȿ MuC9] e[^_ Uujj }5 US] C C C C C C C C d C$d C( C, C0 C4 C8 C< C@ CD CH CL CPZ CTZ CX C\ C` CdF Ch
Cl Cp Ct CxC| ǃ ǃ ǃ ǃ ǃ F ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ?ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ ǃ d ǃ ǃ ǃ ǃ d ǃ ǃ d ǃ d ǃ ǃ l P S ] UE @ @@ @@@@ @ @$ @(@, @0 @4 @8 @< @L @@ @D @H @P UE @ @ @ @ @ @ @ @ @$ @( @,
@0 @4 @8 @< @@@D@H UE U $l ^ R F $ : * . 1 " 9 >
G P X b m y } uȊ mҊ e؊ ] U M E = 5 - % h h h5 hq 1 UEtrt; -B %O h] h h5 hq 0 UEtrtt #o 5s -y % h h h5 hq o0 UE
w}$ } u m eˋ ]Ջ Uߋ M E = 5 - %! h& h/ h5 hq / UEtus &s h? h= h5 hq / UEtrtt #Q 5_ -m %{ h hM h5 hq +/ UEtrt; - % h h\ h5 hq . UEt
t
% hnj hj h5 hq . UEtrtt #ڌ 5ߌ - % h hz h5 hq ?. UEw1$$ = 5$ -* %1 h8 h h5 hq - UEtrtt #E 5P -W %^ hh h h5 hq - UEtrt{ - % h h h5 hq ;- UMU BP UMU BH UWVS}] uj rG|BW|e[^_ UWVS}] uj r B e[^_UWVS] u}jv rzMJ M B e[^_UEU tr&ttRh Rh Rhō Rh : Uuh % Uuhۍ Uuh Uuh UWVS}u Vj
t VVS[ V[PuVj
t VS VS VD[HuVhv de[^_ UWVSu} tPPh W+FtPPh WVtF tPRh WFtPh" W FtPh8 W FtPhP W F tPh] W F tPhk W| F$tPhy We F(tPh WN F0tPPh W2F,tPCPh WF4tPh W F8tP@Phǎ WF< tP#PhԎ WFL tPPh W1ېD@tP*PSh WC~܍e[^_UVS]u CtPPh VSCtPPh V7C tPPh VCtPPPh* VCtPh; V CtPhL V C t2P Phǎ V{ ts PhԎ VC$ tPPhY VtC( tPPhk VWC,
tPh V@ C0tPh V* C4tPPh VC8tPbPh VC<tPhϏ V C@tPhߏ V CDt Ph8 Ve[^ UWVS}u tR Ph VWtRPh Vc1ېTtRPSh V@C~܋WtR{Ph V W tR^Ph VW tRAPh. VW dtRh@ V W$dtRhL V W(tRhY V W,tRhk V W0tRhs Vs W4tRh{ V] W8tRh VF W<tRh V/ W@tRPh VWDtR$Ph VWHtRh V WLtRhԐ V WPZtRh V WTZtRh V WXtRh V W\tRh
Vo W`tRh VX WdFtRh& VA Wh
tRh3 V* WltRhA V WptRhO V WttRh] V WxtRhl V W|t Ӑs3hy V[u拗 t Ӑs3h V[u拗 t$Ӑs ss3h VY[u tRPh V3 tRhё V tRh V tRh V FtRh V tRPh1 V tRPhH V tRPhb Vk tR}Phz VL tR]Ph V, tR=Ph V tR Ph V tRPhʒ V tRPh V tRPh V tRPh Vn tR Ph VO tRaPh0 V0 tR*PhC Vه fE@t $hT V؋ tRhe V tRPhw V tRPh V tRPh Vi tRPh VJ tR\Phʓ V+ tR=Ph֓ V tR Ph V dtRh V tRh V tRh V tRh V dtRh Vi tRh' VP dtRh2 V6 dt Rh= V e[^_ U$@ WVSu E@fz Dž fz TA Pf; ~ f; ۃ t F @9Fs jV F
F ShH 1҉OF 9Fs
WVj Wv j ~
X 4hM 1҉OF 9Fs
WV Wv ~ T P9vj
X 4h| 4 1҉OF 9Fs
WV Wv ~ 9wF @9Fs jVU F .F f; X 4hf 1҉OH 9Hs
WP Wv ~ f; @ 9п[^_UTWVS MILMD fy u 1Mfy MMu Mf| \ [|u9]~E 5 u6M MShډ h lE u
E E X E5 u5 % FMA9Fe[^_U WVS}hs$ h8J j j ]SB M|Q'Whډ h& E& $SWC @9Cs jS" C C sS 9uK(C!S C)Kx)9~ xK C Cu5 Y5 |5 Qh& W
1PRX l[^_ US= hi 5l h0 ж ض $ 5 5 h0 1ۃ9 H ~SNC9 H 5 h0 5 ] U th8 h% j 5 3 jUuFu Uu uu Uu u?u~ UVSuU Mu u EF EF INf(F(tRv$F Ѓ 6F ЃÉ^u ЍCFF FC f( e[^ UVSuU Mu u EF EF INE F$N(F(tRv$F Ѓ
6F ЃÉ^u ЍCFF FC f( e[^ UWVS]KMCs )ƉuE Cxd9}C(tWs$C Ѓ
WC ЃE} u ЋMKuqCCL҉!@~AEP| 4u𐐋CMMJyE$us$C G19U~C:B9UE9Cu C(uuFMAC(uVC Љ{}{ c(e[^_ UEU 9s9s@u% UWVS]} StI9s9:s+rC(tRs$C Ѓ
RC ЃK(uͅt{ {CS
te[^_UWVS]} StI9s9:s+rC(tRs$C Ѓ
RC ЃK(uͅt{ {CS
t"e[^_UE1ɋPt)Ru UhW h} h( 85 USUӹ Ѐ: t 8/uP1@8 u: u
;/utJu x/uhh jDh hq Ћ] Uuu Ph h( UVSu] uuh( t S(
( ( | B
B/z }9B ~B
RB P
h( j
Uh( tVe[^ Uh t5p h h( EPuu uUVS]u=h t+95 u 9tySPtk 5 h 9 t5p h9g h( > tVSh1g h( &E Puu uve[^ UMU ABuA UW}W1щMQR} UVSuu V_ ÍCPp t SVPe[^ Uj uuuu u Ujuuuu u UUM : t9u B: u1 UWVS5 u= }5 u9 }9} U+UE)9~AE19}-u)ƉuMً}<}Uڋu t
>=tF> u]E ; ك MА )PR35 ue+ ;1I9} u
]EE5} u&MЋIE9HuMЋI9Hu
EЋ M9A tE EE; n} t\} uV} t M 41hȔ h( K 1Ӊ]̍T E } MM > Ex t F5 } tN
E Tz-uM10h h( #E0URM 1h h( 1Ӊ]̍T E@ My 9U~E h} tM t1h@ h( 1Ӊ]̍T E@ ? M9:E : ; 1Ӊ]̍T } tMEEP E } t*
E y-t Puux} tK M z-u5 1hf h( %!5 URE 0h h( s ? VuNj : u t:uD} t+= t
VM 1h VE 0h h( rã ? ?W ; E MMM܉M: uc 9UuR} tVE 0hڕ h( 5 M?: ]EԉEE M 5 5 > t >=tF> u]E ; t` )PR3 u9+ ;1I9o} u
]EԉE E Eԃ; u} t\} uV} t
E 40h h(
1Ӊ]̍T ? } F E؉EԀ> tcMy tF5 } tE0M 1h" h( 1Ӊ]̍T ? Exuw 9U~M X} tE t0h@ h( 1Ӊ]̍T ? E8:uX: Q 1Ӊ]̍T } tMԋEEPt
H
1 EP M
W : :u : uc c : uK 9Uu:} tPM 1hڕ h( ۉ E?:uM Íe[^_ Uj j j uu u
Uu ju Uuj UWVS]j$\ޅu e[^_ UEu UUu E UWVSU] % t| ǁ ЉƃE11e[^_UE} u U(WVS1ۉ]]]M $ 9] vE"CE E U E uh uh tu> t 9] v E UCE}? uE MΉ1щHE 9] vU'CE E E }u}? uZ E9EK } t1} t+EE9Er uu}M u
9] vU\CEUEЉуw0 $ } }| E9Em }E|8?\ T8ʃ I $| EEUDE9] v};?C9] vE\C9] U? a%b!f nr tv
M}k } M } }D }2 } 9] v};'C9] vE\C9] vU'Ch t7E } EX E u jjEPg u }uUU؉1щHEU}ffUfȅtHtu"uU9s4}<9 t'AF9Mv } |
EX uE w} } uwu} tH} uB9] vE\C9] vU0};C9] vE$ 0UCE$0EMA9vQ9] v EUCMEE덐} t-UM U | t
9] vE\C9] v U};CE}EU< } t 9] v E UCE}? u9] vE E qe[^_UEu P0uuu u= UWVS}}虾9= wz_4 9t= u j
HV5
)Pj R 4\uju VS'9w: r4V1 tP$¡ Ӊ\uju VS؍e[^_ Uh u u Uuj U$WVS}E uEj j ]܍EP/SVWe[^_ Uu uj U$WVSE }ܾ jP]S1Suj Ve[^_ Uj:u UVSu] Sj Vڅt)Ѝe[^ Uuuu uh( h( ˿藼H( d8 T8 P8 D8 @}8 <# 8# 4/ 0# ,# # # ~# # (# Hy# # $t# o# # ' \, L ' ' ' ' s$ L( |/ I+ ! ' # Entering new_itemsets, state = %d
Entering new_state, state = %d, symbol = %d (%s)
too many states (max %d) Entering get_state, state = %d, symbol = %d (%s)
Exiting get_state => %d
Entering append_states, state = %d
Processing state %d (reached by %s)
Closure: %s
%2d: . %s (rule %d)
FIRSTS
%s firsts
%d (%s)
FDERIVES
%s derives
%d: input output %s:%d: %s: warning: fatal error: Conflict in state %d between rule %d and token %s resolved as %s.
reduce shift an error %d shift/reduce conflict %d shift/reduce conflicts and %s %d reduce/reduce conflict %d reduce/reduce conflicts State %d contains conflicts: %d shift/reduce , %d reduce/reduce %s contains plural.y expected %d shift/reduce conflict
expected %d shift/reduce conflicts
%-4s [reduce using rule %d (%s)]
$default reduce using rule %d (%s)
%-4s reduce using rule %d (%s)
$default reduce using rule %d (%s)
DERIVES
(rule %d)
BISON_ cannot open file `%s' cannot close file w #ifndef %s
# define %s
#endif /* not %s */
.tab _tab y .c .h .vcg .output .stype r .act .guard yvgdhrltknVo:b:p:S: trace graph output-file file-prefix verbose defines token-table raw no-parser no-lines name-prefix locations debug skeleton fixed-output-files yacc version help GNU bison generates parsers for LALR(1) grammars.
Usage: %s [OPTION]... FILE
If a long option shows an argument as mandatory, then it is mandatory
for the equivalent short option also. Similarly for optional arguments.
Operation modes:
-h, --help display this help and exit
-V, --version output version information and exit
-y, --yacc emulate POSIX yacc
Parser:
-S, --skeleton=FILE specify the skeleton to use
-t, --debug instrument the parser for debugging
--locations enable locations computation
-p, --name-prefix=PREFIX prepend PREFIX to the external symbols
-l, --no-lines don't generate `#line' directives
-n, --no-parser generate the tables only
-k, --token-table include a table of token names
Output:
-d, --defines also produce a header file
-v, --verbose also produce an explanation of the automaton
-b, --file-prefix=PREFIX specify a PREFIX for output files
-o, --output=FILE leave output to FILE
-g, --graph also produce a VCG description of the automaton
Report bugs to .
1.33 bison (GNU Bison) %s Copyright 1984, 1986, 1989, 1992, 2000, 2001, 2002
Free Software Foundation, Inc.
This is free software; see the source for copying conditions. There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
--raw `%s' is no longer supported Try `%s --help' for more information.
%s: no grammar file given
%s: extra arguments ignored after `%s'
RITEM
%s too many gotos (max %d) 0 lalr.c %s:%u: failed assertion `%s'
found %3d: %3d transpose: input
transpose: output
unexpected `/' found and ignored unterminated comment unexpected end of file unescaped newline in constant octal value outside range 0...255: `\%o' hexadecimal value above 255: `\x%x' c unknown escape sequence: `\' followed by `%s' unterminated type name at end of file unterminated type name EOF use "..." for multi-character literal tokens : ; | { pure-parser semantic-parser prec binary nonassoc right left start thong expect union guard type nterm term token `%s' supports no argument: %s tx->set_flag lex.c `%s' requires an argument NULLABLE
yes no %s: %s
Entering set_nullable
ritem[rule_table[ruleno].rhs] == -ruleno nullable.c /* %s. */
static const %s %s[] =
{
%6d
%6d
};
short
#include %s
extern int yyerror;
extern int yycost;
extern char * yymsg;
extern YYSTYPE yyval;
yyguard(n, yyvsp, yylsp)
register int n;
register YYSTYPE *yyvsp;
register YYLTYPE *yylsp;
{
yyerror = 0;
yycost = 0;
yymsg = 0;
switch (n)
{
#include %s
extern YYSTYPE yyval;
extern int yychar;
yyaction(n, yyvsp, yylsp)
register int n;
register YYSTYPE *yyvsp;
register YYLTYPE *yylsp;
{
switch (n)
{
switch (yyn) {
#define yyparse %sparse
#define yylex %slex
#define yyerror %serror
#define yylval %slval
#define yychar %schar
#define yydebug %sdebug
#define yynerrs %snerrs
}
}
}
}
/* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */
#define YYTRANSLATE(x) ((unsigned)(x) <= %d ? yytranslate[x] : %d)
YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX char yytranslate
#if YYDEBUG
yyprhs yyrhs
#endif
YYSTOS[STATE] -- Accessing symbol to the STATE yystos YYRLINE[YYN] -- source line where rule number YYN was defined yyrline #endif
#define YYNTOKENS %d
#define YYNNTS %d
#define YYNRULES %d
#define YYNSTATES %d
#define YYMAXUTOK %d
#if (YYDEBUG) || defined YYERROR_VERBOSE
/* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */
static const char *const yytname[] =
{
\%c \n \t \b \%03o ", NULL
};
YYTOKNUM[YYLEX] -- Index in YYTNAME corresponding to YYLEX yytoknum YYR1[YYN] -- Symbol number of symbol that rule YYN derives yyr1 YYR2[YYN] -- Number of symbols composing right hand side of rule YYN yyr2
#define YYFINAL %d
#define YYFLAG %d
#define YYNTBASE %d
YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE
doesn't specify something else to do. Zero means the default is an
error yydefact yydefgoto t output.c maximum table size (%d) exceeded pack_vector_succeeded yypact yypgoto
#define YYLAST %d
yytable yycheck #define YYPURE 1
/usr/local/share/bison/bison.hairy BISON_HAIRY /usr/local/share/bison/bison.simple BISON_SIMPLE #lin #li #l # %% action %% actio %% acti %% act %% ac %% a %% %% % #line %d %s
actions_dumped == 1 #ifndef YYDEBUG
# define YYDEBUG %d
#endif
#include %s
%s -> %s (rule %d) $default accept
NO ACTIONS
$ go to state %d
%-4s shift, and go to state %d
%-4s error (nonassociative)
%-4s go to state %d
state %d Grammar %s
Number, Line, Rule %s
%3d %3d %s -> empty /* %s */ Terminals, with rules where they appear %s (-1)
%s
(%d) %d %s
Nonterminals, with rules where they appear on left: on right: Skipping to next \n Skipping to next %c invalid $ value unterminated string at end of file unterminated string yyloc invalid @ value yylsp[%d] @c %s is invalid yyval .%s $$ of `%s' has no declared type yyvsp[%d] $%d of `%s' has no declared type $c unterminated `%{' definition %s Premature EOF after %s symbol `%s' used more than once as a literal string symbol `%s' given more than one literal string symbol %s redefined type redeclaration for %s %token %nterm `%s' is invalid in %s %start multiple %s declarations invalid %s declaration %type declaration has no invalid %%type declaration due to item: %s redefining precedence of %s invalid text (%s) - number should be after identifier unexpected item: %s #ifndef YYSTYPE
typedef union yystype;
# define YYSTYPE yystype
#endif
%union
#line %d %s
`}' unmatched %s argument of %%expect is not an integer unrecognized item %s, expected an identifier expected string constant instead of %s unrecognized: %s no input grammar unknown character: %s
case %d:
`{' }
break; ;
break;} unterminated %guard clause @%d ill-formed rule: initial symbol not followed by colon grammar starts with vertical bar rule given for %s, which is a token two @prec's in a row %%guard present but %%semantic_parser not specified two actions at end of one rule type clash (`%s' `%s') on default action empty rule for typed nonterminal, and no action invalid input: %s too many symbols (tokens plus nonterminals); maximum %d no rules in the input grammar #ifndef YYSTYPE
#define YYSTYPE int
#endif
# ifndef YYSTYPE
# define YYSTYPE int
# endif
symbol %s is used, but is not defined as a token and has no rules # define %s %d
# define T%s %d
extern YYSTYPE %slval;
extern YYSTYPE yylval;
# define NT%s %d
bp->user_token_number != SUNDEF reader.c tokens %s and %s both assigned number %d conflicting precedences for %s and %s conflicting assoc values for %s and %s the start symbol %s is undefined the start symbol %s is a token error $undefined. Bison-generated parse tables A Bison parser /* %s, made from %s
by GNU bison %s. */
#define YYBISON 1 /* Identify Bison output. */
#define YYLSP_NEEDED 1
#ifndef YYLTYPE
typedef struct yyltype
{
int first_line;
int first_column;
int last_line;
int last_column;
} yyltype;
# define YYLTYPE yyltype
#endif
Useless nonterminals: %s
Terminals which are not used: Useless rules: #%-4d ;
REDUCED GRAMMAR
ntokens = %d, nvars = %d, nsyms = %d, nrules = %d, nitems = %d
Variables
---------
Value Sprec Sassoc Tag
%5d %5d %5d %s
Rules
-----
Num (Prec, Assoc, Useful, Ritem Range) Lhs -> Rhs (Ritem range) [Num]
%3d (%2d, %2d, %2d, %2d-%2d) %2d -> %3d [%d]
Rules interpreted
-----------------
%-5d %s : %d rule never reduced
%d rules never reduced
%d useless nonterminal %d useless nonterminals and %d useless rule %d useless rules
Start symbol %s does not derive any sentence reduced %s defines %d terminals, %d nonterminals, and %d productions.
%s BEGIN
%d . .
%2d| 1 |
` '
%s END
TC: Input TC: Output white blue red green yellow magenta cyan darkgrey darkblue darkred darkgreen darkyellow darkmagenta darkcyan gold lightgrey lightblue lightred lightgreen lightyellow lightmagenta lightcyan lilac turquoise aquamarine khaki purple yellowgreen pink orange orchid black A_known_default_color vcg.c center left_justify right_justify A_known_text_mode box rhomb ellipse triangle A_known_shape normal maxdepth mindepth maxdepthslow mindepthslow maxdegree mindegree maxindegree minindegree maxoutdegree minoutdegree minbackward dfs tree A_known_layout_algorithm Either_yes_nor_no top_to_bottom bottom_to_top left_to_right right_to_left A_knownn_orientation top bottom A_known_alignement fixed free A_known_arrow_mode bary median barymedian medianbary A_known_crossing_type normal_view cfish pfish fcfish fpfish A_known_view continuous dashed dotted invisible A_known_line_style solid line none A_known_arrow_style edge: {
backedge: {
nearedge: {
bentnearedge: {
}
node: {
graph: {
title: %s
label: %s
loc { x: %d y: %d }
vertical_order: %d
horizontal_order: %d
width: %d
height: %d
shrink: %d
stretch: %d
folding: %d
textmode: %s
shape: %s
borderwidth: %d
color: %s
textcolor: %s
bordercolor: %s
info%d: %s
sourcename: %s
targetname: %s
linestyle: %s
thickness: %d
class: %d
arrowcolor: %s
backarrowcolor: %s
arrowsize: %d
backarrowsize: %d
arrowstyle: %s
backarrowstyle: %s
priority: %d
anchor: %d
title: %s
label: %s
info%d: %s
color: %s
textcolor: %s
bordercolor: %s
width: %d
height: %d
borderwidth: %d
x: %d
y: %d
folding: %d
shrink: %d
stretch: %d
textmode: %s
shape: %s
vertical_order: %d
horizontal_order: %d
xmax: %d
ymax: %d
xbase: %d
ybase: %d
xspace: %d
yspace: %d
xlspace: %d
xraster: %d
yraster: %d
xlraster: %d
hidden: %d
classname %d : %s
infoname %d : %s
colorentry %d : %d %d %d
layoutalgorithm: %s
layout_downfactor: %d
layout_upfactor: %d
layout_nearfactor: %d
layout_splinefactor: %d
late_edge_labels: %s
display_edge_labels: %s
dirty_edge_labels: %s
finetuning: %s
ignore_singles: %s
straight_phase: %s
priority_phase: %s
manhattan_edges: %s
smanhattan_edges: %s
near_edges: %s
orientation: %s
node_alignement: %s
port_sharing: %s
arrow_mode: %s
treefactor: %f
spreadlevel: %d
crossing_weight: %s
crossing_phase2: %s
crossing_optimization: %s
view: %s
edges: %s
nodes: %s
splines: %s
bmax: %d
cmin: %d
cmax: %d
pmin: %d
pmax: %d
rmin: %d
rmax: %d
smax: %d
%d: %s -> memory exhausted all_slashes || !ISSLASH (*(p - 1)) basename.c Unknown system error : %s %s: POSIXLY_CORRECT -- %s: option `%s' is ambiguous
%s: option `--%s' doesn't allow an argument
%s: option `%c%s' doesn't allow an argument
%s: option `%s' requires an argument
%s: unrecognized option `--%s'
%s: unrecognized option `%c%s'
%s: illegal option -- %c
%s: invalid option -- %c
%s: option requires an argument -- %c
%s: option `-W %s' is ambiguous
%s: option `-W %s' doesn't allow an argument
clocale locale escape shell-always shell literal " ` ' h_ ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` _ ` ` _ ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` _ _ ` ` 0` ` ` X` x` ` ` @` ` h` ` _ ` ` _ s Ht dt s dt dt dt dt dt dt dt dt dt dt dt dt dt dt dt dt dt dt dt s dt dt dt dt dt dt dt dt dt dt dt dt dt dt /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T std::size_t
# else
# ifdef __STDC__
# include /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
# endif
# define YYSTACK_ALLOC YYSTD (malloc)
# define YYSTACK_FREE YYSTD (free)
# endif
/* A type that is properly aligned for any stack member. */
union yyalloc
{
short yyss;
YYSTYPE yyvs;
# if YYLSP_NEEDED
YYLTYPE yyls;
# endif
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# if YYLSP_NEEDED
# define YYSTACK_BYTES(N) \
((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+ 2 * YYSTACK_GAP_MAX)
# else
# define YYSTACK_BYTES(N) \
((N) * (sizeof (short) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAX)
# endif
/* Relocate the TYPE 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(Type, Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
yymemcpy ((char *) yyptr, (char *) (Stack), \
yysize * (YYSIZE_T) sizeof (Type)); \
Stack = &yyptr->Stack; \
yynewbytes = yystacksize * sizeof (Type) + YYSTACK_GAP_MAX; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
# define YYSIZE_T __SIZE_TYPE__
#endif
#if ! defined (YYSIZE_T) && defined (size_t)
# define YYSIZE_T size_t
#endif
#if ! defined (YYSIZE_T)
# ifdef __cplusplus
# include /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T std::size_t
# else
# ifdef __STDC__
# include /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
# endif
#endif
#if ! defined (YYSIZE_T)
# define YYSIZE_T unsigned int
#endif
#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 yyerrlab1
/* Like YYERROR except do call yyerror. This remains here temporarily
to ease the transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ \
yychar = (Token); \
yylval = (Value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
{ \
yyerror ("syntax error: cannot back up"); \
YYERROR; \
} \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
are run).
When YYLLOC_DEFAULT is run, CURRENT is set the location of the
first token. By default, to implement support for ranges, extend
its range to the last symbol. */
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
Current.last_line = Rhs[N].last_line; \
Current.last_column = Rhs[N].last_column;
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#if YYPURE
# if YYLSP_NEEDED
# ifdef YYLEX_PARAM
# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
# else
# define YYLEX yylex (&yylval, &yylloc)
# endif
# else /* !YYLSP_NEEDED */
# ifdef YYLEX_PARAM
# define YYLEX yylex (&yylval, YYLEX_PARAM)
# else
# define YYLEX yylex (&yylval)
# endif
# endif /* !YYLSP_NEEDED */
#else /* !YYPURE */
# define YYLEX yylex ()
#endif /* !YYPURE */
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# ifdef __cplusplus
# include /* INFRINGES ON USER NAME SPACE */
# else
# include /* INFRINGES ON USER NAME SPACE */
# endif
# define YYFPRINTF YYSTD (fprintf)
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (0)
/* Nonzero means print parse trace. [The following comment makes no
sense to me. Could someone clarify it? --akim] Since this is
uninitialized, it does not stop multiple parsers from coexisting.
*/
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
#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
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#if YYMAXDEPTH == 0
# undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if ! defined (yyoverflow) && ! defined (yymemcpy)
# if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
# define yymemcpy __builtin_memcpy
# else /* not GNU C or C++ */
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
# if defined (__STDC__) || defined (__cplusplus)
yymemcpy (char *yyto, const char *yyfrom, YYSIZE_T yycount)
# else
yymemcpy (yyto, yyfrom, yycount)
char *yyto;
const char *yyfrom;
YYSIZE_T yycount;
# endif
{
register const char *yyf = yyfrom;
register char *yyt = yyto;
register YYSIZE_T yyi = yycount;
while (yyi-- != 0)
*yyt++ = *yyf++;
}
# endif
#endif
#ifdef YYERROR_VERBOSE
# ifndef yystrlen
# if defined (__GLIBC__) && defined (_STRING_H)
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
# if defined (__STDC__) || defined (__cplusplus)
yystrlen (const char *yystr)
# else
yystrlen (yystr)
const char *yystr;
# endif
{
register const char *yys = yystr;
while (*yys++ != '\0')
continue;
return yys - yystr - 1;
}
# 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 *
# if defined (__STDC__) || defined (__cplusplus)
yystpcpy (char *yydest, const char *yysrc)
# else
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
# endif
{
register char *yyd = yydest;
register const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
#endif
#line
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
into yyparse. The argument should have type void *.
It should actually point to an object.
Grammar actions can access the variable by casting it
to the proper pointer type. */
#ifdef YYPARSE_PARAM
# ifdef __cplusplus
# define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
# define YYPARSE_PARAM_DECL
# else /* !__cplusplus */
# define YYPARSE_PARAM_ARG YYPARSE_PARAM
# define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
# endif /* !__cplusplus */
#else /* !YYPARSE_PARAM */
# define YYPARSE_PARAM_ARG
# define YYPARSE_PARAM_DECL
#endif /* !YYPARSE_PARAM */
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
# ifdef YYPARSE_PARAM
int yyparse (void *);
# else
int yyparse (void);
# endif
#endif
/* YY_DECL_VARIABLES -- depending whether we use a pure parser,
variables are global, or local to YYPARSE. */
#define YY_DECL_NON_LSP_VARIABLES \
/* The lookahead symbol. */ \
int yychar; \
\
/* The semantic value of the lookahead symbol. */ \
YYSTYPE yylval; \
\
/* Number of parse errors so far. */ \
int yynerrs;
#if YYLSP_NEEDED
# define YY_DECL_VARIABLES \
YY_DECL_NON_LSP_VARIABLES \
\
/* Location data for the lookahead symbol. */ \
YYLTYPE yylloc;
#else
# define YY_DECL_VARIABLES \
YY_DECL_NON_LSP_VARIABLES
#endif
/* If nonreentrant, generate the variables here. */
#if !YYPURE
YY_DECL_VARIABLES
#endif /* !YYPURE */
int
yyparse (YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
/* If reentrant, generate the variables here. */
#if YYPURE
YY_DECL_VARIABLES
#endif /* !YYPURE */
register int yystate;
register int yyn;
int yyresult;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* Lookahead token as an internal (translated) token number. */
int yychar1 = 0;
/* Three stacks and their tools:
`yyss': related to states,
`yyvs': related to semantic values,
`yyls': related to locations.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
short yyssa[YYINITDEPTH];
short *yyss = yyssa;
register short *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
register YYSTYPE *yyvsp;
#if YYLSP_NEEDED
/* The location stack. */
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#endif
#if YYLSP_NEEDED
# define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
# define YYPOPSTACK (yyvsp--, yyssp--)
#endif
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYLSP_NEEDED
YYLTYPE yyloc;
#endif
/* When reducing, the number of symbols on the RHS of the reduced
rule. */
int yylen;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss;
yyvsp = yyvs;
#if YYLSP_NEEDED
yylsp = yyls;
#endif
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 (yyssp >= yyss + yystacksize - 1)
{
/* 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;
short *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. */
# if YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
/* This used to be a conditional around just the two extra args,
but that might be undefined if yyoverflow is a macro. */
yyoverflow ("parser stack overflow",
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yyls1, yysize * sizeof (*yylsp),
&yystacksize);
yyls = yyls1;
# else
yyoverflow ("parser stack overflow",
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
# endif
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
goto yyoverflowlab;
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
{
short *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyoverflowlab;
YYSTACK_RELOCATE (short, yyss);
YYSTACK_RELOCATE (YYSTYPE, yyvs);
# if YYLSP_NEEDED
YYSTACK_RELOCATE (YYLTYPE, yyls);
# endif
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
#if YYLSP_NEEDED
yylsp = yyls + yysize - 1;
#endif
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
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. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more */
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yychar1 = YYTRANSLATE (yychar);
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables
which are defined only if `YYDEBUG' is set. */
if (yydebug)
{
YYFPRINTF (stderr, "Next token is %d (%s",
yychar, yytname[yychar1]);
/* Give the individual parser a way to print the precise
meaning of a token, for further debugging info. */
# ifdef YYPRINT
YYPRINT (stderr, yychar, yylval);
# endif
YYFPRINTF (stderr, ")\n");
}
#endif
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
YYDPRINTF ((stderr, "Shifting token %d (%s), ",
yychar, yytname[yychar1]));
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#if YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
yystate = yyn;
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 the semantic value of
the lookahead token. 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];
#if YYLSP_NEEDED
/* Similarly for the default location. Let the user run additional
commands if for instance locations are ranges. */
yyloc = yylsp[1-yylen];
YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
#endif
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables which
are defined only if `YYDEBUG' is set. */
if (yydebug)
{
int yyi;
YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++)
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
%% actions /* The action file replaces this line. */
#line
yyvsp -= yylen;
yyssp -= yylen;
#if YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#if YYLSP_NEEDED
*++yylsp = yyloc;
#endif
/* 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 - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
YYSIZE_T yysize = 0;
char *yymsg;
int yyx, yycount;
yycount = 0;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
if (yycheck[yyx + yyn] == yyx)
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
yysize += yystrlen ("parse error, unexpected ") + 1;
yysize += yystrlen (yytname[YYTRANSLATE (yychar)]);
yymsg = (char *) YYSTACK_ALLOC (yysize);
if (yymsg != 0)
{
char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]);
if (yycount < 5)
{
yycount = 0;
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *));
yyx++)
if (yycheck[yyx + yyn] == yyx)
{
const char *yyq = ! yycount ? ", expecting " : " or ";
yyp = yystpcpy (yyp, yyq);
yyp = yystpcpy (yyp, yytname[yyx]);
yycount++;
}
}
yyerror (yymsg);
YYSTACK_FREE (yymsg);
}
else
yyerror ("parse error; also virtual memory exhausted");
}
else
#endif /* defined (YYERROR_VERBOSE) */
yyerror ("parse error");
}
goto yyerrlab1;
/*--------------------------------------------------.
| yyerrlab1 -- error raised explicitly by an action |
`--------------------------------------------------*/
yyerrlab1:
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
yychar, yytname[yychar1]));
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token after shifting the error
token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
/*-------------------------------------------------------------------.
| yyerrdefault -- current state does not do anything special for the |
| error token. |
`-------------------------------------------------------------------*/
yyerrdefault:
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
/* If its default is to accept any token, ok. Otherwise pop it. */
yyn = yydefact[yystate];
if (yyn)
goto yydefault;
#endif
/*---------------------------------------------------------------.
| yyerrpop -- pop the current state because it cannot handle the |
| error token |
`---------------------------------------------------------------*/
yyerrpop:
if (yyssp == yyss)
YYABORT;
yyvsp--;
yystate = *--yyssp;
#if YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "Error: state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
/*--------------.
| yyerrhandle. |
`--------------*/
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
YYDPRINTF ((stderr, "Shifting error token, "));
*++yyvsp = yylval;
#if YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
/*---------------------------------------------.
| yyoverflowab -- parser overflow comes here. |
`---------------------------------------------*/
yyoverflowlab:
yyerror ("parser stack overflow");
yyresult = 2;
/* Fall through. */
yyreturn:
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
return yyresult;
}
f
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
./share/bison/bison.hairy 644 0 0 14634 7440353677 10575 /* -*- C -*- */
extern int timeclock;
int yyerror; /* Yyerror and yycost are set by guards. */
int yycost; /* If yyerror is set to a nonzero value by a */
/* guard, the reduction with which the guard */
/* is associated is not performed, and the */
/* error recovery mechanism is invoked. */
/* Yycost indicates the cost of performing */
/* the reduction given the attributes of the */
/* symbols. */
/* YYMAXDEPTH indicates the size of the parser's state and value */
/* stacks. */
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 500
#endif
/* YYMAXRULES must be at least as large as the number of rules that */
/* could be placed in the rule queue. That number could be determined */
/* from the grammar and the size of the stack, but, as yet, it is not. */
#ifndef YYMAXRULES
#define YYMAXRULES 100
#endif
#ifndef YYMAXBACKUP
#define YYMAXBACKUP 100
#endif
short yyss[YYMAXDEPTH]; /* the state stack */
YYSTYPE yyvs[YYMAXDEPTH]; /* the semantic value stack */
YYLTYPE yyls[YYMAXDEPTH]; /* the location stack */
short yyrq[YYMAXRULES]; /* the rule queue */
int yychar; /* the lookahead symbol */
YYSTYPE yylval; /* the semantic value of the */
/* lookahead symbol */
YYSTYPE yytval; /* the semantic value for the state */
/* at the top of the state stack. */
YYSTYPE yyval; /* the variable used to return */
/* semantic values from the action */
/* routines */
YYLTYPE yylloc; /* location data for the lookahead */
/* symbol */
YYLTYPE yytloc; /* location data for the state at the */
/* top of the state stack */
int yynunlexed;
short yyunchar[YYMAXBACKUP];
YYSTYPE yyunval[YYMAXBACKUP];
YYLTYPE yyunloc[YYMAXBACKUP];
short *yygssp; /* a pointer to the top of the state */
/* stack; only set during error */
/* recovery. */
YYSTYPE *yygvsp; /* a pointer to the top of the value */
/* stack; only set during error */
/* recovery. */
YYLTYPE *yyglsp; /* a pointer to the top of the */
/* location stack; only set during */
/* error recovery. */
/* Yyget is an interface between the parser and the lexical analyzer. */
/* It is costly to provide such an interface, but it avoids requiring */
/* the lexical analyzer to be able to back up the scan. */
yyget()
{
if (yynunlexed > 0)
{
yynunlexed--;
yychar = yyunchar[yynunlexed];
yylval = yyunval[yynunlexed];
yylloc = yyunloc[yynunlexed];
}
else if (yychar <= 0)
yychar = 0;
else
{
yychar = yylex();
if (yychar < 0)
yychar = 0;
else yychar = YYTRANSLATE(yychar);
}
}
yyunlex(chr, val, loc)
int chr;
YYSTYPE val;
YYLTYPE loc;
{
yyunchar[yynunlexed] = chr;
yyunval[yynunlexed] = val;
yyunloc[yynunlexed] = loc;
yynunlexed++;
}
yyrestore(first, last)
register short *first;
register short *last;
{
register short *ssp;
register short *rp;
register int symbol;
register int state;
register int tvalsaved;
ssp = yygssp;
yyunlex(yychar, yylval, yylloc);
tvalsaved = 0;
while (first != last)
{
symbol = yystos[*ssp];
if (symbol < YYNTBASE)
{
yyunlex(symbol, yytval, yytloc);
tvalsaved = 1;
ssp--;
}
ssp--;
if (first == yyrq)
first = yyrq + YYMAXRULES;
first--;
for (rp = yyrhs + yyprhs[*first]; symbol = *rp; rp++)
{
if (symbol < YYNTBASE)
state = yytable[yypact[*ssp] + symbol];
else
{
state = yypgoto[symbol - YYNTBASE] + *ssp;
if (state >= 0 && state <= YYLAST && yycheck[state] == *ssp)
state = yytable[state];
else
state = yydefgoto[symbol - YYNTBASE];
}
*++ssp = state;
}
}
if ( ! tvalsaved && ssp > yyss)
{
yyunlex(yystos[*ssp], yytval, yytloc);
ssp--;
}
yygssp = ssp;
}
int
yyparse()
{
register int yystate;
register int yyn;
register short *yyssp;
register short *yyrq0;
register short *yyptr;
register YYSTYPE *yyvsp;
int yylen;
YYLTYPE *yylsp;
short *yyrq1;
short *yyrq2;
yystate = 0;
yyssp = yyss - 1;
yyvsp = yyvs - 1;
yylsp = yyls - 1;
yyrq0 = yyrq;
yyrq1 = yyrq0;
yyrq2 = yyrq0;
yychar = yylex();
if (yychar < 0)
yychar = 0;
else yychar = YYTRANSLATE(yychar);
yynewstate:
if (yyssp >= yyss + YYMAXDEPTH - 1)
{
yyabort("Parser Stack Overflow");
YYABORT;
}
*++yyssp = yystate;
yyresume:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
yyn += yychar;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar)
goto yydefault;
yyn = yytable[yyn];
if (yyn < 0)
{
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
yystate = yyn;
yyptr = yyrq2;
while (yyptr != yyrq1)
{
yyn = *yyptr++;
yylen = yyr2[yyn];
yyvsp -= yylen;
yylsp -= yylen;
yyguard(yyn, yyvsp, yylsp);
if (yyerror)
goto yysemerr;
yyaction(yyn, yyvsp, yylsp);
*++yyvsp = yyval;
yylsp++;
if (yylen == 0)
{
yylsp->timestamp = timeclock;
yylsp->first_line = yytloc.first_line;
yylsp->first_column = yytloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
if (yyptr == yyrq + YYMAXRULES)
yyptr = yyrq;
}
if (yystate == YYFINAL)
YYACCEPT;
yyrq2 = yyptr;
yyrq1 = yyrq0;
*++yyvsp = yytval;
*++yylsp = yytloc;
yytval = yylval;
yytloc = yylloc;
yyget();
goto yynewstate;
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
yyreduce:
*yyrq0++ = yyn;
if (yyrq0 == yyrq + YYMAXRULES)
yyrq0 = yyrq;
if (yyrq0 == yyrq2)
{
yyabort("Parser Rule Queue Overflow");
YYABORT;
}
yyssp -= yyr2[yyn];
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yysemerr:
*--yyptr = yyn;
yyrq2 = yyptr;
yyvsp += yyr2[yyn];
yyerrlab:
yygssp = yyssp;
yygvsp = yyvsp;
yyglsp = yylsp;
yyrestore(yyrq0, yyrq2);
yyrecover();
yystate = *yygssp;
yyssp = yygssp;
yyvsp = yygvsp;
yyrq0 = yyrq;
yyrq1 = yyrq0;
yyrq2 = yyrq0;
goto yyresume;
}
%% actions
yunchar[yynunlexed];
yylval = yyunval[yynunlexed];
yylloc = yyunloc[yynunlexed];
}
./info/ 755 0 0 0 7441017513 5012 ./info/bison.info 644 0 0 0 7440356052 6777 ./man/ 755 0 0 0 7441017514 4633 ./man/man1/ 755 0 0 0 7441017515 5470 ./man/man1/bison.1 644 0 0 15102 7440353702 6770 .TH BISON 1 local
.SH NAME
bison \- GNU Project parser generator (yacc replacement)
.SH SYNOPSIS
.B bison
[
.BI \-b " file-prefix"
] [
.BI \-\-file-prefix= file-prefix
] [
.B \-d
] [
.BI \-\-defines= defines-file
] [
.B \-g
] [
.BI \-\-graph= graph-file
] [
.B \-k
] [
.B \-\-token-table
] [
.B \-l
] [
.B \-\-no-lines
] [
.B \-n
] [
.B \-\-no-parser
] [
.BI \-o " outfile"
] [
.BI \-\-output-file= outfile
] [
.BI \-p " prefix"
] [
.BI \-\-name-prefix= prefix
] [
.B \-t
] [
.B \-\-debug
] [
.B \-v
] [
.B \-\-verbose
] [
.B \-V
] [
.B \-\-version
] [
.B \-y
] [
.B \-\-yacc
] [
.B \-h
] [
.B \-\-help
] [
.B \-\-fixed-output-files
]
file
.SH DESCRIPTION
.I Bison
is a parser generator in the style of
.IR yacc (1).
It should be upwardly compatible with input files designed
for
.IR yacc .
.PP
Input files should follow the
.I yacc
convention of ending in
.BR .y .
Unlike
.IR yacc ,
the generated files do not have fixed names, but instead use the prefix
of the input file.
Moreover, if you need to put
.IR C++
code in the input file, you can end his name by a C++-like extension
(.ypp or .y++), then bison will follow your extension to name the
output file (.cpp or .c++).
For instance, a grammar description file named
.B parse.yxx
would produce the generated parser in a file named
.BR parse.tab.cxx ,
instead of
.IR yacc 's
.BR y.tab.c
or old
.IR Bison
versions
.BR parse.tab.c .
.PP
This description of the options that can be given to
.I bison
is adapted from the node
.B Invocation
in the
.B bison.texinfo
manual, which should be taken as authoritative.
.PP
.I Bison
supports both traditional single-letter options and mnemonic long
option names. Long option names are indicated with
.B \-\-
instead of
.BR \- .
Abbreviations for option names are allowed as long as they
are unique. When a long option takes an argument, like
.BR \-\-file-prefix ,
connect the option name and the argument with
.BR = .
.SS OPTIONS
.TP
.BI \-b " file-prefix"
.br
.ns
.TP
.BI \-\-file-prefix= file-prefix
Specify a prefix to use for all
.I bison
output file names. The names are
chosen as if the input file were named
\fIfile-prefix\fB.c\fR.
.TP
.B \-d
.br
.ns
Write an extra output file containing macro definitions for the token
type names defined in the grammar and the semantic value type
.BR YYSTYPE ,
as well as a few
.B extern
variable declarations.
.sp
If the parser output file is named
\fIname\fB.c\fR
then this file
is named
\fIname\fB.h\fR.
.sp
This output file is essential if you wish to put the definition of
.B yylex
in a separate source file, because
.B yylex
needs to be able to refer to token type codes and the variable
.BR yylval .
.TP
.BI \-\-defines= defines-file
The behaviour of
.BI \-\-defines
is the same than
.BI \-d
option.
The only difference is that it has an optionnal argument which is
the name of the output filename.
.TP
.BI \-g
.br
.ns
Output a VCG definition of the LALR(1) grammar automaton computed by
Bison. If the grammar file is
.BR foo.y
, the VCG output file will be
.BR foo.vcg .
.TP
.BI \-\-graph= graph-file
The behaviour of
.BI \-\-graph
is the same than
.BI \-g
option. The only difference is that it has an optionnal argument which
is the name of the output graph filename.
.TP
.B \-k
.br
.ns
.TP
.B \-\-token-table
This switch causes the \fIname\fB.tab.c\fR output to include a list of
token names in order by their token numbers; this is defined in the array
.IR yytname .
Also generated
are #defines for
.IR YYNTOKENS ,
.IR YYNNTS ,
.IR YYNRULES ,
and
.IR YYNSTATES .
.TP
.B \-l
.br
.ns
.TP
.B \-\-no-lines
Don't put any
.B #line
preprocessor commands in the parser file.
Ordinarily
.I bison
puts them in the parser file so that the C compiler
and debuggers will associate errors with your source file, the
grammar file. This option causes them to associate errors with the
parser file, treating it an independent source file in its own right.
.TP
.B \-n
.br
.ns
.TP
.B \-\-no-parser
Do not generate the parser code into the output; generate only
declarations. The generated \fIname\fB.tab.c\fR file will have only
constant declarations. In addition, a \fIname\fB.act\fR file is
generated containing a switch statement body containing all the
translated actions.
.TP
.BI \-o " outfile"
.br
.ns
.TP
.BI \-\-output-file= outfile
Specify the name
.I outfile
for the parser file.
.sp
The other output files' names are constructed from
.I outfile
as described under the
.B \-v
and
.B \-d
switches.
.TP
.BI \-p " prefix"
.br
.ns
.TP
.BI \-\-name-prefix= prefix
Rename the external symbols used in the parser so that they start with
.I prefix
instead of
.BR yy .
The precise list of symbols renamed is
.BR yyparse ,
.BR yylex ,
.BR yyerror ,
.BR yylval ,
.BR yychar ,
and
.BR yydebug .
.sp
For example, if you use
.BR "\-p c" ,
the names become
.BR cparse ,
.BR clex ,
and so on.
.TP
.B \-t
.br
.ns
.TP
.B \-\-debug
In the parser file, define the macro
.B YYDEBUG
to 1 if it is not already defined,
so that the debugging facilities are compiled.
.TP
.B \-v
.br
.ns
.TP
.B \-\-verbose
Write an extra output file containing verbose descriptions of the
parser states and what is done for each type of look-ahead token in
that state.
.sp
This file also describes all the conflicts, both those resolved by
operator precedence and the unresolved ones.
.sp
The file's name is made by removing
.B .tab.c
or
.B .c
from the parser output file name, and adding
.B .output
instead.
.sp
Therefore, if the input file is
.BR foo.y ,
then the parser file is called
.B foo.tab.c
by default. As a consequence, the verbose
output file is called
.BR foo.output .
.TP
.B \-V
.br
.ns
.TP
.B \-\-version
Print the version number of
.I bison
and exit.
.TP
.B \-h
.br
.ns
.TP
.B \-\-help
Print a summary of the options to
.I bison
and exit.
.TP
.B \-y
.br
.ns
.TP
.B \-\-yacc
.br
.ns
.TP
.B \-\-fixed-output-files
Equivalent to
.BR "\-o y.tab.c" ;
the parser output file is called
.BR y.tab.c ,
and the other outputs are called
.B y.output
and
.BR y.tab.h .
The purpose of this switch is to imitate
.IR yacc 's
output file name conventions.
Thus, the following shell script can substitute for
.IR yacc :
.sp
.RS
.ft B
bison \-y $*
.ft R
.sp
.RE
.SH FILES
/usr/local/share/bison/bison.simple simple parser
.br
/usr/local/share/bison/bison.hairy complicated parser
.SH "ENVIRONMENT VARIABLES"
.TP
.SM BISON_SIMPLE
If this is set, it specifies the location in which the
.B bison.simple
parser can be found.
.TP
.SM BISON_HAIRY
If this is set, it specifies the location in which the
.B bison.hairy
parser can be found.
.SH SEE ALSO
.IR yacc (1)
.br
The
.IR "Bison Reference Manual" ,
included as the file
.B bison.texinfo
in the
.I bison
source distribution.
.SH DIAGNOSTICS
Self explanatory.
== *ssp)
state = yytable[state];
else
state = yydefgoto[symbol - YYNTBASE];
}
*++ssp = state;
}
}
if ( ! tvalsaved && ssp > yyss)
{
yyunlex(yystos[*ssp], yytval, yytloc);
ssp--;
}
yygssp = ssp;
}
int
yyparse()
{
register int yystate;
register int yyn;
register short *yyssp;
register short *yyrq0;
register short *yyptr;
register YYSTYPE *yyvsp;
int yylen;
YYLTYPE *yylsp;
.TH BISON 1 local
.SH NAME
bison \- GNU Project parser generator (yacc replacement)
.SH SYNOPSIS
.B bison
[
.BI \-b " file-prefix"
] [
.BI \-\-file-prefix= file-prefix
] [
.B \-d
] [
.BI \-\-defines= defines-file
] [
.B \-g
] [
.BI \-\-graph= graph-file
] [
.B \-k
] [
.B \-\-token-table
] [
.B \-l
] [
.B \-\-no-lines
] [
.B \-n
] [
.B \-\-no-parser
] [
.BI \-o " outfile"
] [
.BI \-\-output-file= outfile
] [
.BI \-p " prefix"
] [
.BI \-\-name-prefix= prefix
] [
.B \-t
] [
.B \-\-debug
] [
.B \-v
] [
.B \-\-verbose
] [
.B \-V
] [
.B \-\-version
] [
.B \-y
] [
.B \-\-yacc
] [
.B \-h
] [
.B \-\-help
] [
.B \-\-fixed-output-files
]
file
.SH DESCRIPTION
.I Bison
is a parser generator in the style of
.IR yacc (1).
It should be upwardly compatible with input files designed
for
.IR yacc .
.PP
Input files should follow the
.I yacc
convention of ending in
.BR .y .
Unlike
.IR yacc ,
the generated files do not have fixed names, but instead use the prefix
of the input file.
Moreover, if you need to put
.IR C++
code in the input file, you can end his name by a C++-like extension
(.ypp or .y++), then bison will follow your extension to name the
output file (.cpp or .c++).
For instance, a grammar description file named
.B parse.yxx
would produce the generated parser in a file named
.BR parse.tab.cxx ,
instead of
.IR yacc 's
.BR y.tab.c
or old
.IR Bison
versions
.BR parse.tab.c .
.PP
This description of the options that can be given to
.I bison
is adapted from the node
.B Invocation
in the
.B bison.texinfo
manual, which should be taken as authoritative.
.PP
.I Bison
supports both traditional single-letter options and mnemonic long
option names. Long option names are indicated with
.B \-\-
instead of
.BR \- .
Abbreviations for option names are allowed as long as they
are unique. When a long option takes an argument, like
.BR \-\-file-prefix ,
connect the option name and the argument with
.BR = .
.SS OPTIONS
.TP
.BI \-b " file-prefix"
.br
.ns
.TP
.BI \-\-file-prefix= file-prefix
Specify a prefix to use for all
.I bison
output file names. The names are
chosen as if the input file were named
\fIfile-prefix\fB.c\fR.
.TP
.B \-d
.br
.ns
Write an extra output file containing macro definitions for the token
type names defined in the grammar and the semantic value type
.BR YYSTYPE ,
as well as a few
.B extern
variable declarations.
.sp
If the parser output file is named
\fIname\fB.c\fR
then this file
is named
\fIname\fB.h\fR.
.sp
This output file is essential if you wish to put the definition of
.B yylex
in a separate source file, because
.B yylex
needs to be able to refer to token type codes and the variable
.BR yylval .
.TP
.BI \-\-defines= defines-file
The behaviour of
.BI \-\-defines
is the same than
.BI \-d
option.
The only difference is that it has an optionnal argument which is
the name of the output filename.
.TP
.BI \-g
.br
.ns
Output a VCG definition of the LALR(1) grammar automaton computed by
Bison. If the grammar file is
.BR foo.y
, the VCG output file will be
.BR foo.vcg .
.TP
.BI \-\-graph= graph-file
The behaviour