?_Dÿÿÿÿ|¡4+lpM `ˆ Ø‚Ž‚ ‡ 1G‚ ‚ÿ‚ŽC ̃1Gƒ1G(G1ƒ‚ä„€€„€€€ˆ€€€€€À„ÿÿ„ÿÿÿˆÿÿÿÿÿoÿÿ†ðÿƒÿÿƒÿ„ððÿ†ðððÿƒðÿùÿ‚ÿ÷ÿ‚ûÿ÷ÿƒû¿ÿóÿƒñ»ÿò ÿƒ¿!ÿƒñ»ÿü ÿƒ¿ÿõ ÿƒñ»ÿü ÿƒ»ÿü ÿ„ñ»¿!ÿƒ»ÿý ÿ„¿ÿû ÿ„ñ»ÿ÷ ÿ„¿ÿûÿƒ»ÿòÿ„ñ» ÿ…ñ»¿ ÿ„ñ»ÿƒõÿÿ »ƒ±»ƒÿþÿñ…ÿþÿÿÿÿ…ÿýÿÿ…ÿ÷ÿÿ…ÿ÷ÿÿ‹ò/ÿ"ò""/""/"ˆò""ò/ÿÿ"ÿ…ÿûÿÿ‹ò/ÿ"ò""/""/"ˆò""ò/ÿÿ"ÿ…ÿúÿÿ“ò/ÿ"ò/ÿÿ"ÿÿ"ÿÿò/ÿò/ÿÿÿ–ò/ÿ"ò/ÿÿ"ÿÿ"ÿÿò/ÿò""ÿ"ÿ…ÿýÿÿò"’ò""ÿ"ÿÿ"ÿÿò/ÿò""/"ÿ…ÿõÿÿò"’ò""ÿ"ÿÿ"ÿÿò/ÿò/ò/"ÿ…ÿþÿÿ–ò/ÿ"ò/ÿÿ"ÿÿ"ÿÿò/ÿò/ò/"ÿ…ÿöÿÿ–ò/ÿ"ò""/"ÿÿ"ÿÿò/ÿò""/"ÿÿÿ–ò/ÿ"ò""/"ÿÿ"ÿÿò/ÿò""ÿ"ÿ…ÿýÿÿ…ÿûÿÿ…ÿ÷ÿÿ„ÿûÿ ƒÿòGÿ‚þ/&;)z4ÿÿ ‚ ÿÿÿÿ|CONTEXTM™|CTXOMAP@e|FONTÔ[|KWBTREEïh|KWDATAKe|KWMAPØh|SYSTEMs|TOPICç|TTLBTREE|bm0tkl!^ÌX;ANS94 chapter 6 COREî(Unregistered evaluation copy of HELLLP!(Unregistered evaluation copy of HELLLP!#CB("About_btn","&About","About()")DB(`btn_print')Zmain  ;ÌÌÌÌîÌ¡¢ºîíRäRÿÿÿÿ 1ÿÿÿÿ=1ÿÿÿÿÿÿÿÿÿÿÿÿ=)ì· )5 8€o€€‚€‚€‚‚€€‚‚ÿHelp file produced byHELLLP!www.guysoftware.com/helllp.html(If this topic is presented in file testing theauthor should use the HELLLP! Ibutton to define a contents topic)1=Z1ŒÿÿÿÿÿÿÿÿZÿÿÿÿµ[7)µ$ €n€˜˜€ÿyesyesyesyesANS94 chapter 6 CORE31Chap6yesyes21/07/01BZ÷1šÿÿÿÿÿÿÿÿ÷4·LTable of Contents=µ4( €*€˜˜€€‚ÿTable of Contents&÷Z# €€€‚ÿ®4’#ô€8 Š § ¿  "€€ãV­J¿€‰‚ÿ€ €ãW­J¿‰‚ÿ€€ãX­J¿‰‚ÿ€"€ãho€‰‚ÿ€.€ãY­J¿‰‚ÿÿÿ!##>#S'±Z¹’#ô€> Š § ¿  "€€ãZ­J¿€‰‚ÿ€ €ã[­J¿‰‚ÿ€€ã\­J¿‰‚ÿ€"€ãi}K‰‚ÿ€4€ã]­J¿‰‚ÿÿÿ(**/*/MOD+±j’#ô€> Š § ¿  "€€ã^­J¿€‰‚ÿ€€ãK=ºB‰‚ÿ€ €ãÜ«J¿‰‚ÿ€*€ãÓ«J¿‰‚ÿ€4€ãÔ«J¿‰‚ÿÿÿ+!+LOOP,-.² ¹’#ô€@ Š § ¿  "€€ãÕ«J¿€‰‚ÿ€€ãÖ«J¿‰‚ÿ€€ãi}K‰‚ÿ€(€ã׫J¿‰‚ÿ€4€ãØ«J¿‰‚ÿÿÿ."//MOD0<0=±jÍ’#ô€> Š § ¿  "€€ãÙ«J¿€‰‚ÿ€€ãÚ«J¿‰‚ÿ€€ãÛ«J¿‰‚ÿ€&€ã¬J¿‰‚ÿ€2€ãþ«J¿‰‚ÿÿÿ1+1-2!2*2/Œ*‰’#ô€T Š § ¿  "€€ãÿ«J¿€‰‚ÿ€€ã¬J¿‰‚ÿ€ €ã¬J¿‰‚ÿ€0€ã¬J¿‰‚ÿ€B€ã¬J¿‰‚ÿÿÿ2@2DROP2DUP2OVER2SWAP­Í6’#ô€6 Š § ¿  "€€ã¬J¿€‰‚ÿ€ €ã¬J¿‰‚ÿ€€ã¬J¿‰‚ÿ€ €ã2¬J¿‰‚ÿ€,€ã)¬J¿‰‚ÿÿÿ:;<<#=¹'‰ï’#ô€N Š § ¿  "€€ã*¬J¿€‰‚ÿ€ €ãý‡뉂ÿ€€ãºp(‰‚ÿ€,€ãÁ”@T‰‚ÿ€B€ã­CMw‰‚ÿÿÿ>>BODY>IN>NUMBER>Rº(6©’#ô€P Š § ¿  "€€ãsß ü€‰‚ÿ€€ã+¬J¿‰‚ÿ€€ãB\W≂ÿ€.€ãC\W≂ÿ€B€ãD\W≂ÿÿÿ?DUP@ABORTABORT"ABSÁ/ïj ’#ô€^ Š § ¿  "€€ãE\W ‚ÿ€€ãF\W≂ÿ€(€ãG\W≂ÿ€>€ãH\W≂ÿ€P€ãI\W≂ÿÿÿACCEPTALIGNALIGNEDALLOTAND¶$© ’#ô€H Š § ¿  "€€ãþ‡ë€‰‚ÿ€€ãÿ‡뉂ÿ€$€ãˆ뉂ÿ€0€ãž³Ýó‰‚ÿ€<€ã¹³Ýó‰‚ÿÿÿBASEBEGINBLC!C,Œ*j Ü ’#ô€T Š § ¿  "€€ãº³Ý󀉂ÿ€€ã»³Ýó‰‚ÿ€ €ãŒ³Ýó‰‚ÿ€2€ãœ³Ýó‰‚ÿ€B€ãŸ³Ýó‰‚ÿÿÿC@CELL+CELLSCHARCHAR+Á/  ’#ô€^ Š § ¿  "€€ã¿³Ý󀉂ÿ€€ãÀ³Ýó‰‚ÿ€,€ã>²Ýó‰‚ÿ€>€ã5²Ýó‰‚ÿ€J€ã6²Ýó‰‚ÿÿÿCHARSCONSTANTCOUNTCRCREATEŸ,Ü [ ’#ô€X Š § ¿  "€€ãtß ü€‰‚ÿ€€ãuß ü‰‚ÿ€*€ãvß ü‰‚ÿ€6€ãwß ü‰‚ÿ€H€ãxß ü‰‚ÿÿÿDECIMALDEPTHDODOES>DROPÆ4 ! ’#ô€h Š § ¿  "€€ãyß ü€‰‚ÿ€€ã. d‰‚ÿ€ €ã/ d‰‚ÿ€0€ã0 d‰‚ÿ€P€ã1 d‰‚ÿÿÿDUPELSEEMITENVIRONMENT?EVALUATEœ+[ Þ ’#ô€V Š § ¿  "€€ã2 d€‰‚ÿ€€ãé6'‰‚ÿ€"€ãê6'‰‚ÿ€2€ãùái‰‚ÿ€F€ã_Ž­‰‚ÿÿÿEXITFILLFINDFM/MODHEREœ+! ›’#ô€V Š § ¿  "€€ã`Ž­€‰‚ÿ€€ãºp(‰‚ÿ€€ãºp(‰‚ÿ€(€ãºp(‰‚ÿ€B€ãºp(‰‚ÿÿÿHOLDIIFIMMEDIATEINVERT»)Þ V’#ô€R Š § ¿  "€€ãÕå31€‰‚ÿ€ €ã÷9‰‚ÿ€€ãL=ºB‰‚ÿ€,€ãM=ºB‰‚ÿ€B€ãN=ºB‰‚ÿÿÿJKEYLEAVELITERALLOOPž&›@’#ô€L Š § ¿  "€€ãO=ºB€‰‚ÿ€€ãi}K‰‚ÿ€"€ã i}K‰‚ÿ€0€ã i}K‰‚ÿ€>€ã i}K‰‚ÿÿÿLSHIFTM*MAXV@µMINMOD¿-VÙ@’#ô€Z Š § ¿  "€€ã i}K€‰‚ÿ€€ã”@T‰‚ÿ€&€ã|À]‰‚ÿ€2€ã}À]‰‚ÿ€B€ã7ìÆe‰‚ÿÿÿMOVENEGATEOROVERPOSTPONEŒ*@•A’#ô€T Š § ¿  "€€ãòŠn€‰‚ÿ€€ã®CMw‰‚ÿ€€ã¯CMw‰‚ÿ€*€ã°CMw‰‚ÿ€@€ã±CMw‰‚ÿÿÿQUITR>R@RECURSEREPEAT¹'Ù@NB’#ô€N Š § ¿  "€€ã²CMw€‰‚ÿ€€ã³CMw‰‚ÿ€$€ãio€‰‚ÿ€0€ã?š}‰‚ÿ€>€ãjo€‰‚ÿÿÿROTRSHIFTS"S>DSIGNÃ1•AC’#ô€b Š § ¿  "€€ãíïW„€‰‚ÿ€€ãko€‰‚ÿ€*€ãlo€‰‚ÿ€<€ãmo€‰‚ÿ€P€ãno€‰‚ÿÿÿSM/REMSOURCESPACESPACESSTATE·%NBÈC’#ô€J Š § ¿  "€€ãoo€€‰‚ÿ€€ã#›Óˆ‰‚ÿ€"€ã$›Óˆ‰‚ÿ€2€ãÞƖ‘‰‚ÿ€>€ãßƖ‘‰‚ÿÿÿSWAPTHENTYPEU.U<Ã1C‹D’#ô€b Š § ¿  "€€ãàƖ‘€‰‚ÿ€€ãîqٔ‰‚ÿ€$€ãáƖ‘‰‚ÿ€8€ãâƖ‘‰‚ÿ€J€ã™òYš‰‚ÿÿÿUM*UM/MODUNLOOPUNTILVARIABLE·%ÈCBE’#ô€J Š § ¿  "€€ãT£€‰‚ÿ€€ãU£‰‚ÿ€$€ãJૉ‚ÿ€2€ã,¬J¿‰‚ÿ€<€ã-¬J¿‰‚ÿÿÿWHILEWORDXOR[[']¶$‹DøE’#ô€H Š § ¿  "€€ã7²Ý󀉂ÿ€€ã.¬J¿‰‚ÿ€ €ã%›Óˆ‰‚ÿ€0€ã/¬J¿‰‚ÿ€<€ã0¬J¿‰‚ÿÿÿ[CHAR]]#TIB.(.Rµ#BE­F’#ô€F Š § ¿  "€€ã1¬J¿€‰‚ÿ€€ã]¬J¿‰‚ÿ€€ãÛ-’É‚ÿ€*€ãT¬J¿‰‚ÿ€8€ãU¬J¿‰‚ÿÿÿ0<>0>2>R2R>2R@º(øEgG’#ô€P Š § ¿  "€€ãÔ@T€‰‚ÿ€€ãV¬J¿‰‚ÿ€$€ãzß ü‰‚ÿ€2€ãJ\W≂ÿ€D€ã8²Ýó‰‚ÿÿÿ:NONAME<>?DOAGAINC"Æ4­F-H’#ô€h Š § ¿  "€€ã9²Ý󀉂ÿ€€ã:²Ýó‰‚ÿ€*€ã;²Ýó‰‚ÿ€@€ã3 d‰‚ÿ€V€ã4 d‰‚ÿÿÿCASECOMPILE,CONVERTENDCASEENDOFÀ.gGíH’#ô€\ Š § ¿  "€€ã5 d€‰‚ÿ€€ã6 d‰‚ÿ€(€ãë6'‰‚ÿ€:€ãaŽ­‰‚ÿ€H€ã i}K‰‚ÿÿÿERASEEXPECTFALSEHEXMARKERž&-H¥I’#ô€L Š § ¿  "€€ãĔ@T€‰‚ÿ€€ã~À]‰‚ÿ€€ã8ìÆe‰‚ÿ€*€ã9ìÆe‰‚ÿ€<€ã:ìÆe‰‚ÿÿÿNIPOFPADPARSEPICKÍ;íHrJ’#ô€v Š § ¿  "€€ãóŠn€‰‚ÿ€€ãŽCMw‰‚ÿ€(€ãùC¿y‰‚ÿ€J€ãµCMw‰‚ÿ€Z€ãŽo‚‚‰‚ÿÿÿQUERYREFILLRESTORE-INPUTROLLSAVE-INPUTœ+¥I/K’#ô€V Š § ¿  "€€ãµo‚‚€‰‚ÿ€€ãpo€‰‚ÿ€,€ã&›Óˆ‰‚ÿ€:€ã'›Óˆ‰‚ÿ€F€ã(›Óˆ‰‚ÿÿÿSOURCE-IDSPANTIBTOTRUE»)rJêK’#ô€R Š § ¿  "€€ã)›Óˆ€‰‚ÿ€€ããƖ‘‰‚ÿ€ €ãäƖ‘‰‚ÿ€,€ãåƖ‘‰‚ÿ€@€ãšòYš‰‚ÿÿÿTUCKU.RU>UNUSEDVALUE§!/K‘L†#܀B Š § ¿  "€€ãV£€‰‚ÿ€€ã<²Ýó‰‚ÿ€0€ãW¬J¿‰‚ÿ€:€‚ÿ€>€‚ÿÿÿWITHIN[COMPILE]\&êK·L# €€€‚ÿ1‘LèL1WÿÿÿÿÿÿÿÿÿÿÿÿèLM&·LM# €€€‚ÿ1èL?M1lÿÿÿÿÿÿÿÿÿÿÿÿ?M†‚V+M•O+ $€W€€€ €‚‚ÿHelp file produced by HELLLP! v3.1b , a product of Guy Software, on 21/07/01 for Unregistered User.The above table of contents will be automatically completed and will also provide an excellent cross-reference for context strings and topic titles. You may leave it as your main table of contents for your help file, or you may create your own and cause it to be displayed instead by using the I button on the toolbar. This page will not be displayed as a topic. It is given a context string of _._ , but this is not presented for jump selection.ò?M»( €å€€‚€‚ÿHINT: If you do not wish some of your topics to appear in the tab•O»Mle of contents as displayed to your users (you may want them ONLY as PopUps), move the lines with their titles and contexts to below this point. If you do this remember to move the whole line, not part. As an alternative, you may wish to set up your own table of contents, see Help under The Structure of a Help File. Do not delete any codes in the area above the Table of Contents title, they are used internally by HELLLP!(•Oã$ €€€‚‚ÿ>»!‚* $€(€°€ € € ‚ÿ6. Glossary >ã_‚( €,€°˜€ € ‚ÿ6.1 Core words '!‚†‚$ €€R€‚ÿ2_‚ž‚1îÿÿÿÿÿÿÿÿž‚á‚ž„!)†‚á‚% €€˜˜€‚ÿ!c%ž‚Dƒ> L€J€‘€‚H€€€€ƒ€€€€ƒ‚ÿ6.1.0010 ! «store»CORET႘ƒ< H€0€Œ˜RQ‚H€€€€€€€‚ÿ( x a-addr -- )ODƒçƒ6 <€2€Œ˜RQ‚H€€€€€‚ÿStore x at a-addr.Œ;˜ƒs„Q r€v€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€€ã+¬J¿€‰€‚ÿSee:3.3.3.1 Address alignment, 6.1.0650 @+烞„( €€R‚9€‚ÿ2s„Є1ÿÿÿÿÿÿÿÿЄù„Iˆ#)ž„ù„% €€˜˜€‚ÿ#e*Є^…; F€T€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0030 # «number-sign»CORESù„±…< H€.€Œ˜RQ‚H€€€€€€€‚ÿ( ud1 -- ud2 )Òe^…ƒ‡m š€Ë€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€‚ÿDivide ud1 by the number in BASE giving the quotient ud2 and the remainder n. (n is the least-significant digit of ud1.) Convert n to external form and add the resulting character to the beginning of the pictured numeric output string. An ambiguous condition exists if # executes outside of a <# #> delimited number conversion.›>±…ˆ] Š€|€^Œ˜RQ³~‚9€ƒƒ€ãX­J¿€‰€€ãho€€‰€€ã2¬J¿€‰€‚ÿSee:6.1.0040 #>, 6.1.0050 #S, 6.1.0490 <#.+ƒ‡Iˆ( €€R‚9€‚ÿ3ˆ|ˆ1Âÿÿÿÿÿÿÿÿ|ˆŠˆ7‹#>*IˆŠˆ% € €˜˜€‚ÿ#>n3|ˆ‰; F€f€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0040 #> «number-sign-greater»COREWŠˆk‰< H€6€Œ˜RQ‚H€€€€€€€‚ÿ( xd -- c-addr u )ȉrŠ? L€‘€Œ˜RQ‚H€€€€€€€‚ÿDrop xd. Make the pictured numeric output string available as a character string. c-addr and u specify the resulting character string. A program may replace characters within the string.š=k‰ ‹] Š€z€^Œ˜RQ³~‚9€ƒƒ€ãW­J¿€‰€€ãho€€‰€€ã2¬J¿€‰€‚ÿSee:6.1.0030 #, 6.1.0050 #S, 6.1.0490 <#.+rŠ7‹( €€R‚9€‚ÿ3 ‹j‹1åÿÿÿÿÿÿÿÿj‹”‹HŽ#S*7‹”‹% € €˜˜€‚ÿ#Sh-j‹ü‹; F€Z€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0050 #S «number-sign-s»CORES”‹OŒ< H€.€Œ˜RQ‚H€€€€€€€‚ÿ( ud1 -- ud2 )4ãü‹ƒQ p€Ç€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿConvert one digit of ud1 according to the rule for #. Continue conversion until the quotient is zero. ud2 is zero. An ambiguous condition exists if #S executes outside of a <# #> delimited number conversion.š=OŒŽ] Š€z€^Œ˜RQ³~‚9€ƒƒ€ãW­J¿€‰€€ãX­J¿€‰€€ã2¬J¿€‰€‚ÿSee:6.1.0030 #, 6.1.0040 #>, 6.1.0490 <#.+ƒHŽ( €€R‚9€‚ÿ2ŽzŽ1‡ÿÿÿÿÿÿÿÿ zŽ£ŽÂ')HŽ£Ž% €€˜˜€‚ÿ'^#zŽ; F€F€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0070 ' «tick»CORE]!£Ž^< H€B€Œ˜RQ‚H€€€€€€€‚ÿ( «name» -- xt )ŒqÀK d€y€Œ˜RQ‚H€€€€€€€€€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Find name and r^qÀHŽeturn xt, the execution token for name. An ambiguous condition exists if name is not found.s=^äÀ6 <€z€Œ˜RQ‚H€€€€€‚ÿWhen interpreting, ' xyz EXECUTE is equivalent to xyz.öƒqÀÚÁs Ž€€^Œ˜RQ³~‚9€ƒ€€ƒ€ã€á牀€€€€ã7ìÆe€‰€€ã-¬J¿€‰€€€€‚ÿSee:3.4 The Forth text interpreter, 3.4.1 Parsing, A.6.1.2033 POSTPONE, A.6.1.2510 ['], D.6.7 Immediacy.+äÀÂ( €€R‚9€‚ÿ2ÚÁ7Â1&ÿÿÿÿÿÿÿÿ 7Â`ÂUÅ()Â`Â% €€˜˜€‚ÿ(_$7¿Â; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0080 ( «paren»CORE¬d`ÂkÃH `€È€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿCompilation:Perform the execution semantics given below.Execution:( «ccc» -- )O¿ÂøÃ> L€ž€Œ˜RQ‚9€€€€€€€‚ÿParse ccc delimited by ) (right parenthesis). ( is an immediate word.‘_kÉÄ2 4€Ÿ€Œ˜RQ‚9€€€‚ÿThe number of characters in ccc may be zero to the number of characters in the parse area.v.øÃÿÄH `€\€^Œ˜RQ³~‚9€ƒƒ€ãK5所€€€€‚ÿSee:3.4.1 Parsing, 11.6.1.0080 (.+‰Ä*Å( €€R‚9€‚ÿ+ÿÄUÅ( €€R‚9€‚ÿ2*ŇÅ1ÿÿÿÿÿÿÿÿ ‡Å°Å“Ç*)UÅ°Å% €€˜˜€‚ÿ*^#‡ÅÆ; F€F€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0090 * «star»CORE-°Å›Æ` €Z€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿ( n1|u1 n2|u2 -- n3|u3 )ŠFÆAÇ` €Œ€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿMultiply n1|u1 by n2|u2 giving the product n3|u3.)›ÆjÇ& €€R‚H€‚ÿ)AǓÇ& €€R‚H€‚ÿ3jÇÆÇ1#ÿÿÿÿÿÿÿÿ ÆÇðÇâË*/*“ÇðÇ% € €˜˜€‚ÿ*/e*ÆÇUÈ; F€T€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0100 */ «star-slash»COREw#ðÇÌÈT x€F€Œ˜RQ‚H€€€€€€€€€€€€€€€‚ÿ( n1 n2 n3 -- n4 )ZÍUÈ&ˍ 耛€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿMultiply n1 by n2 producing the intermediate double-cell result d. Divide d by n3 giving the single-cell quotient n4. An ambiguous condition exists if n3 is zero or if the quotient n4 lies outside the range of a signed number. If d and n3 differ in sign, the implementation-defined result returned will be the same as that returned by either the phrase >R M* R> FM/MOD SWAP DROP or the phrase >R M* R> SM/REM SWAP DROP.f'ÌȌË? N€N€^Œ˜RQ³~‚9€ƒ€ƒ€ã1Ë&㉀‚ÿSee:3.2.2.1 Integer division.+&Ë·Ë( €€R‚9€‚ÿ+ŒËâË( €€R‚9€‚ÿ6·ËÌ1^ÿÿÿÿÿÿÿÿ ÌEÌ|*/MOD-âËEÌ% €€˜˜€‚ÿ*/MODl1̱Ì; F€b€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0110 */MOD «star-slash-mod»CORE~'EÌ/ÍW ~€N€Œ˜RQ‚H€€€€€€€€€€€€€€€€‚ÿ( n1 n2 n3 -- n4 n5 )…ï±ÌŽÏ– ú€ß€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿMultiply n1 by n2 producing the intermediate double-cell result d. Divide d by n3 producing the single-cell remainder n4 and the single-cell quotient n5. An ambiguous condition exists if n3 is zero, or if the quotient n5 lies outside the range of a single-cell signed integer. If d and n3 differ in sign, the implementation-defined result returned will be the same as that returned by either the phrase >R M* R> FM/MOD or the phrase >R M* R> SM/REM. f'/Í&? N€N€^Œ˜RQ³~‚9€ƒ€ƒ€ã1Ë&㉀‚ÿSee:3.2.ŽÏ&âË2.1 Integer division.+ŽÏQ( €€R‚9€‚ÿ+&|( €€R‚9€‚ÿ2Q®1Mÿÿÿÿÿÿÿÿ®×ó+)|×% €€˜˜€‚ÿ+^#®5; F€F€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0120 + «plus»COREŽ.×Ã` €\€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿ ( n1|u1 n2|u2 -- n3|u3 )ž>5a` €|€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿAdd n2|u2 to n1|u1, giving the sum n3|u3.g(ÃÈ? N€P€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀‚ÿSee:3.3.3.1 Address alignment.+aó( €€R‚9€‚ÿ3È&1ïÿÿÿÿÿÿÿÿ&P+!*óP% € €˜˜€‚ÿ+!e*&µ; F€T€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0130 +! «plus-store»COREVP < H€4€Œ˜RQ‚H€€€€€€€‚ÿ( n|u a-addr -- )q5µ|< H€j€Œ˜RQ‚H€€€€€€€‚ÿAdd n|u to the single-cell number at a-addr.g( ã? N€P€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ〉‚ÿSee:3.3.3.1 Address alignment.+|( €€R‚9€‚ÿ6ãD1ÀÿÿÿÿÿÿÿÿDq +LOOP-q% €€˜˜€‚ÿ+LOOPg,DØ; F€X€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0140 +LOOP «plus-loop»CORE¯mq‡B T€Ú€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: do-sys -- )PØ×B R€€Œ˜RQ‚9€€€€€€€‚ÿAppend the run-time semantics given below to the current definition. Resolve the destination of all unresolved occurrences of LEAVE between the location given by do-sys and the next location for a transfer of control, to execute the words following +LOOP. Š?‡aK f€~€^Œ˜RQ³~‚9€ƒ€ƒ€€€€€€€€‚ÿRun-time:( n -- ) ( R: loop-sys1 -- | loop-sys2 )¬u× 7 <€ë€Œ˜RQ‚9€€€‚ÿAn ambiguous condition exists if the loop control parameters are unavailable. Add n to the loop index. If the loop index did not cross the boundary between the loop limit minus one and the loop limit, continue execution at the beginning of the loop. Otherwise, discard the current loop control parameters and continue execution immediately following the loop. @aª ] Š€€€^Œ˜RQ³~‚9€ƒ€ƒãvß ü€‰€€ãºp(€‰€€ãL=ºB€‰€‚ÿSee:6.1.1240 DO, 6.1.1680 I, 6.1.1760 LEAVE.+ Õ ( €€R‚9€‚ÿ+ª  ( €€R‚9€‚ÿ2Õ 2 1(ÿÿÿÿÿÿÿÿ2 [ R,) [ % €€˜˜€‚ÿ,_$2 º ; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0150 , «comma»CORE= [ ÷ 0 0€€Œ˜RQ‚H€€€‚ÿ( x -- )]º T F Z€/€Œ˜RQ‚H€€€€€€€€€‚ÿReserve one cell of data space and store x in the cell. If the data-space pointer is aligned when , begins execution, it will remain aligned when , finishes execution. An ambiguous condition exists if the data-space pointer is not aligned prior to execution of ,.šQ÷ ü W ~€¢€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€€€€ãH\W €‚ÿSee:3.3.3 Data space, 3.3.3.1 Address alignment. 6.1.0710 ALLOT+T '( €€R‚9€‚ÿ+ü R( €€R‚9€‚ÿ2'„1ÿÿÿÿÿÿÿÿ„­A-)R­% €€˜˜€‚ÿ-_$„ ; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0160 - «minus»COREŽ.­š` €\€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿ ( n1|u1 n2|u2 -- n3|u3 )¬L R@` €˜€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿSubtršR@Ract n2|u2 from n1|u1, giving the difference n3|u3.g(š¹@? N€P€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀‚ÿSee:3.3.3.1 Address alignment.+R@ä@( €€R‚9€‚ÿ+¹@A( €€R‚9€‚ÿ2ä@AA1ÛÿÿÿÿÿÿÿÿAAjAC.)AjA% €€˜˜€‚ÿ.]"AAÇA; F€D€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0180 . «dot»CORE= jAB0 0€€Œ˜RQ‚H€€€‚ÿ( n -- )T$ÇAXB0 0€H€Œ˜RQ‚H€€€‚ÿDisplay n in free field format.‘LBéBE Z€˜€^Œ˜RQ³~‚9€ƒ€ƒ€ã.öÌ剀€€‚ÿSee:3.2.1.2 Digit conversion, 3.2.1.3 Free-field number display.+XBC( €€R‚9€‚ÿ3éBGC10ÿÿÿÿÿÿÿÿGCqCpF."*CqC% € €˜˜€‚ÿ."d)GCÕC; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0190 ." «dot-quote»COREºrqCDH `€ä€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( «ccc» -- )¯vÕC>E9 B€ì€Œ˜RQ‚9€€€€€‚ÿParse ccc delimited by " (double-quote). Append the run-time semantics given below to the current definition.HD†E3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )C>EÉE2 4€"€Œ˜RQ‚9€€€‚ÿDisplay ccc.|.†EEFN l€\€^Œ˜RQ³~‚9€ƒ€ƒ€ãK5所€ã/¬J¿€‰€‚ÿSee:3.4.1 Parsing, 6.2.0200 .(.+ÉEpF( €€R‚9€‚ÿ2EF¢F14ÿÿÿÿÿÿÿÿ¢FËFÎI/)pFËF% €€˜˜€‚ÿ/_$¢F*G; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0230 / «slash»CORE`ËFŠGE Z€6€Œ˜RQ‚H€€€€€€€€€€‚ÿ( n1 n2 -- n3 )³C*G=Ip ®€‡€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€‚ÿDivide n1 by n2, giving the single-cell quotient n3. An ambiguous condition exists if n2 is zero. If n1 and n2 differ in sign, the implementation-defined result returned will be the same as that returned by either the phrase >R S>D R> FM/MOD SWAP DROP or the phrase >R S>D R> SM/REM SWAP DROP.f'ŠG£I? N€N€^Œ˜RQ³~‚9€ƒ€ƒ€ã1Ë&㉀‚ÿSee:3.2.2.1 Integer division.+=IÎI( €€R‚9€‚ÿ5£IJ1bÿÿÿÿÿÿÿÿJ/J`M/MOD,ÎI/J% €€˜˜€‚ÿ/MODf+J•J; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0240 /MOD «slash-mod»COREo!/JKN l€B€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿ( n1 n2 -- n3 n4 )ËR•JÏLy À€¥€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿDivide n1 by n2, giving the single-cell remainder n3 and the single-cell quotient n4. An ambiguous condition exists if n2 is zero. If n1 and n2 differ in sign, the implementation-defined result returned will be the same as that returned by either the phrase >R S>D R> FM/MOD or the phrase >R S>D R> SM/REM.f'K5M? N€N€^Œ˜RQ³~‚9€ƒ€ƒ€ã1Ë&㉀‚ÿSee:3.2.2.1 Integer division.+ÏL`M( €€R‚9€‚ÿ35M“M1Ñÿÿÿÿÿÿÿÿ“MœM]O0<*`MœM% € €˜˜€‚ÿ0<d)“M!N; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0250 0< «zero-less»COREJœMkN6 <€(€Œ˜RQ‚H€€€€€‚ÿ( n -- flag )i6!NÔN3 6€l€Œ˜RQ‚H€€€€‚ÿflag is true if and only if n is less than zero.^kN2OB T€8€^Œ˜RQ³~‚9€ƒ€ƒ€ãØ«J¿€‰€‚ÿSee:6.1.0270 0=+ÔN]O( €€R‚9€‚ÿ32OO1ÓÿÿÿÿÿÿÿÿOºOh0=*]OºO% € €˜˜€‚ÿ0=f+O,€; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0270 ºO,€]O 0= «zero-equals»COREJºOv€6 <€(€Œ˜RQ‚H€€€€€‚ÿ( x -- flag )h5,€ހ3 6€j€Œ˜RQ‚H€€€€‚ÿflag is true if and only if x is equal to zero._v€=B T€:€^Œ˜RQ³~‚9€ƒ€ƒ€ã1¬J¿€‰€‚ÿSee:6.1.0250 0<.+ހh( €€R‚9€‚ÿ3=›1áÿÿÿÿÿÿÿÿ›Łuƒ1+*hŁ% € €˜˜€‚ÿ1+c(›(‚; F€P€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0290 1+ «one-plus»COREp"Ł˜‚N l€D€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿ ( n1|u1 -- n2|u2 )‡9(‚ƒN l€r€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿAdd one (1) to n1|u1 giving the sum n2|u2.V˜‚uƒ: D€8€R‚H€ƒ€ƒ€ãÚ«J¿€‰€‚ÿSee:6.1.0300 1-3ƒšƒ1ðÿÿÿÿÿÿÿÿšƒ҃‘…1-*uƒ҃% € €˜˜€‚ÿ1-d)šƒ6„; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0300 1- «one-minus»COREp"҃Š„N l€D€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿ ( n1|u1 -- n2|u2 )•G6„;…N l€Ž€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿSubtract one (1) from n1|u1 giving the difference n2|u2.VŠ„‘…: D€8€R‚H€ƒ€ƒ€ãÙ«J¿€‰€‚ÿSee:6.1.0290 1+3;…ą1³ÿÿÿÿÿÿÿÿąî…pˆ2!*‘…î…% € €˜˜€‚ÿ2!d)ąR†; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0310 2! «two-store»CORE`î…²†B T€<€Œ˜RQ‚H€€€€€€€€€‚ÿ( x1 x2 a-addr -- ) šR†Œ‡b ’€Q€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿStore the cell pair x1 x2 at a-addr, with x2 at a-addr and x1 at the next consecutive cell. It is equivalent to the sequence SWAP OVER ! CELL+ !.‰;²†EˆN l€v€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€ãÿ«J¿€‰€‚ÿSee:3.3.3.1 Address alignment, 6.1.0350 2@+Œ‡pˆ( €€R‚9€‚ÿ3Eˆ£ˆ1üÿÿÿÿÿÿÿÿ£ˆ͈˜Š2**pˆ͈% € €˜˜€‚ÿ2*c(£ˆ0‰; F€P€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0320 2* «two-star»COREQ͈‰< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( x1 -- x2 )Á†0‰BŠ; D€ €Œ˜RQ‚H€€€€€€‚ÿx2 is the result of shifting x1 one bit toward the most-significant bit, filling the vacated least-significant bit with zero.V‰˜Š: D€8€R‚H€ƒ€ƒ€ãþ«J¿€‰€‚ÿSee:6.1.0330 2/3BŠˊ1ôÿÿÿÿÿÿÿÿˊõŠžŒ2/*˜ŠõŠ% € €˜˜€‚ÿ2/d)ˊY‹; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0330 2/ «two-slash»COREQõŠª‹< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( x1 -- x2 )ž~Y‹bŒ: D€ü€Œ˜RQ‚H€€€€€€‚ÿx2 is the result of shifting x1 one bit toward the least-significant bit, leaving the most-significant bit unchanged.Vª‹žŒ: D€8€R‚H€ƒ€ƒ€ã¬J¿€‰€‚ÿSee:6.1.0320 2*3bŒëŒ1Ÿÿÿÿÿÿÿÿÿ댍¢2@*žŒ% € €˜˜€‚ÿ2@d)ëŒy; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0350 2@ «two-fetch»CORE`ٍB T€<€Œ˜RQ‚H€€€€€€€€€‚ÿ( a-addr -- x1 x2 )ŽyïŽb ’€i€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿFetch the cell pair x1 x2 stored at a-addr. x2 is stored at a-addr and x1 at the next consecutive cell. It is equivalent to the sequence DUP CELL+ @ SWAP @.ˆ:ٍwN l€t€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€ãÛ«J¿€‰€‚ÿSee:3.3.3.1 Address alignment, 6.1.0310 2!.+( €€R‚9€‚ÿ6w؏1Šÿÿÿÿÿÿÿÿ؏ÀZÁ2DROP-¢À% €€˜˜€‚ÿ2D؏À¢ROPf+؏wÀ; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0370 2DROP «two-drop»COREQÀÈÀ< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( x1 x2 -- )i-wÀ1Á< H€Z€Œ˜RQ‚H€€€€€€€‚ÿDrop cell pair x1 x2 from the stack.)ÈÀZÁ& €€R‚H€‚ÿ51ÁÁ1«ÿÿÿÿÿÿÿÿ Á»Á5Ã2DUP,ZÁ»Á% €€˜˜€‚ÿ2DUPe*Á Â; F€T€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0380 2DUP «two-dupe»CORE-»Á­Â` €Z€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿ( x1 x2 -- x1 x2 x1 x2 )_#  Ã< H€F€Œ˜RQ‚H€€€€€€€‚ÿDuplicate cell pair x1 x2.)­Â5Ã& €€R‚H€‚ÿ6 ÃkÃ1ûÿÿÿÿÿÿÿÿ!kØÃbÅ2OVER-5ØÃ% €€˜˜€‚ÿ2OVERf+kÃþÃ; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0400 2OVER «two-over»COREÉE˜ÃÇÄ„ ؀Š€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿ( x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 )r6þÃ9Å< H€l€Œ˜RQ‚H€€€€€€€‚ÿCopy cell pair x1 x2 to the top of the stack.)ÇÄbÅ& €€R‚H€‚ÿ69ŘÅ1áÿÿÿÿÿÿÿÿ"˜ÅÅÅuÇ2SWAP-bÅÅÅ% €€˜˜€‚ÿ2SWAPf+˜Å+Æ; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0430 2SWAP «two-swap»CORE«9ÅÅÖÆr Ž€r€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿ( x1 x2 x3 x4 -- x3 x4 x1 x2 )M#+Æ#Ç* $€F€Œ˜RQ‚H€‚ÿExchange the top two cell pairs.)ÖÆLÇ& €€R‚H€‚ÿ)#ÇuÇ& €€R‚H€‚ÿ2LǧÇ1¥ÿÿÿÿÿÿÿÿ#§ÇÐÇDÏ:)uÇÐÇ% €€˜˜€‚ÿ:_$§Ç/È; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0450 : «colon»COREg+ÐÇ–È< H€V€Œ˜RQ‚H€€€€€€€‚ÿ( C: «name» -- colon-sys )p$/ÈÊL f€I€Œ˜RQ‚H€€€€€€€€€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Create a definition for name, called a «colon definition». Enter compilation state and start the current definition, producing colon-sys. Append the initiation semantics given below to the current definition.0÷–È6Ë9 @€ï€Œ˜RQ‚H€€€€€‚ÿThe execution semantics of name will be determined by the words compiled into the body of the definition. The current definition shall not be findable in the dictionary until it is ended (or until the execution of DOES> in some systems).ƒ;ʹËH `€v€^Œ˜RQ³~‚9€ƒ€€ƒ€€€€€€‚ÿInitiation:( i*x -- i*x ) ( R: -- nest-sys )Ύ6ˇÌ@ N€€Œ˜RQ‚9€€€€€€€‚ÿSave implementation-dependent information nest-sys about the calling definition. The stack effects i*x represent arguments to name.n)¹ËõÌE Z€R€^Œ˜RQ³~‚9€ƒ€€€ƒ€€€€‚ÿname Execution:( i*x -- j*x )Ƀ‡ÌŸÍF Z€€Œ˜RQ‚9€€€€€€€€€‚ÿExecute the definition name. The stack effects i*x and j*x represent arguments to and results from name, respectively.0€õÌîÎŒ æ€I€^Œ˜RQ³~‚9€ƒƒ€ã€á牀€ãK5所€㓠ã‰€€ãwß ü€‰€€ã,¬J¿€‰€€ã.¬J¿€‰€€€€‚ÿSee:3.4 The Forth text interpreter, 3.4.1 Parsing, 3.4.5 Compilation, 6.1.1250 DOES>, 6.1.2500 [, 6.1.2540 ], 15.6.2.0470 ;CODE.+ŸÍÏ( €€R‚9€‚ÿ+îÎDÏ( €€R‚9€‚ÿ2ÏvÏ1Mÿÿÿÿÿÿÿÿ$vϟϳ;)DÏŸÏ% €€˜˜€‚ÿ;c(vÏ; F€P€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0460 ; «semicolon»COREŸÏDϲpŸÏÀB T€à€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: colon-sys -- )G6 :€#€Œ˜RQ‚9€€€‚ÿAppend the run-time semantics below to the current definition. End the current definition, allow it to be found in the dictionary and enter interpretation state, consuming colon-sys. If the data-space pointer is not aligned, reserve enough data space to align it.e,Àl9 B€X€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( -- ) ( R: nest-sys -- )n<Ú2 4€x€Œ˜RQ‚9€€€‚ÿReturn to the calling definition specified by nest-sys.®TlˆZ „€š€^Œ˜RQ³~‚9€ƒ€ƒ€ã€á牀€㓠ã‰€€ã¬J¿€‰€‚ÿSee:3.4 The Forth text interpreter, 3.4.5 Compilation, 6.1.0450 :+Ú³( €€R‚9€‚ÿ2ˆå1îÿÿÿÿÿÿÿÿ%åË<)³% €€˜˜€‚ÿ<c(åq; F€P€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0480 < «less-than»CORE^ÏB T€8€Œ˜RQ‚H€€€€€€€€€‚ÿ( n1 n2 -- flag )x9qG? N€r€Œ˜RQ‚H€€€€€€€€‚ÿflag is true if and only if n1 is less than n2.YÏ ? N€4€^Œ˜RQ³~‚9€ƒƒ€ãßƖ‘€‰€‚ÿSee:6.1.2340 U<.+GË( €€R‚9€‚ÿ3 þ1&ÿÿÿÿÿÿÿÿ&þ(<#*Ë(% € €˜˜€‚ÿ<#k0þ“; F€`€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0490 <# «less-number-sign»CORE3 (Æ* $€€Œ˜RQ‚H€‚ÿ( -- )g=“-* $€z€Œ˜RQ‚H€‚ÿInitialize the pictured numeric output conversion process.š=ÆÇ] Š€z€^Œ˜RQ³~‚9€ƒƒ€ãW­J¿€‰€€ãX­J¿€‰€€ãho€€‰€‚ÿSee:6.1.0030 #, 6.1.0040 #>, 6.1.0050 #S.+-ò( €€R‚9€‚ÿ+Ç( €€R‚9€‚ÿ2òO1Çÿÿÿÿÿÿÿÿ'Ox =)x% €€˜˜€‚ÿ=`%OØ; F€J€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0530 = «equals»CORE^x6 B T€8€Œ˜RQ‚H€€€€€€€€€‚ÿ( x1 x2 -- flag )†GØŒ ? N€Ž€Œ˜RQ‚H€€€€€€€€‚ÿflag is true if and only if x1 is bit-for-bit the same as x2.)6 å & €€R‚H€‚ÿ)Œ  & €€R‚H€‚ÿ2å @ 1ÿÿÿÿÿÿÿÿ(@ i W >) i % €€˜˜€‚ÿ>f+@ Ï ; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0540 > «greater-than»CORE^i - B T€8€Œ˜RQ‚H€€€€€€€€€‚ÿ( n1 n2 -- flag ){<Ï š ? N€x€Œ˜RQ‚H€€€€€€€€‚ÿflag is true if and only if n1 is greater than n2.Y-  ? N€4€^Œ˜RQ³~‚9€ƒƒ€ãäƖ‘€‰€‚ÿSee:6.2.2350 U>.+š , ( €€R‚9€‚ÿ+ W ( €€R‚9€‚ÿ6,  1eÿÿÿÿÿÿÿÿ) º î>BODY-W º % €€˜˜€‚ÿ>BODYe*  ; F€T€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0550 >BODY «to-body»COREMº l 6 <€.€Œ˜RQ‚H€€€€€‚ÿ( xt -- a-addr )΍ :A P€€Œ˜RQ‚H€€€€€€€€‚ÿa-addr is the data-field address corresponding to xt. An ambiguous condition exists if xt is not for a word defined via CREATE. ^l ˜? N€>€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀‚ÿSee:3.3.3 Data space.+:Ã( €€R‚9€‚ÿ+˜î( €€R‚9€‚ÿ4Ã"11ÿÿÿÿÿÿÿÿ*"Mï@>IN+îM% € €˜˜€‚ÿ>INa&"®; F€L€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0560 >IN «to-in»COREBM @0 0€$€Œ˜RQ‚H€€€‚ÿ( -- a-addr )® @®Æ@/ ,€€Œ˜RQ‚H€€‚ÿa-addr is the address of a cell containing the offset in characters from the start of the input buffer to the start of the parse area.) @ï@& €€R‚H€‚ÿ8Æ@'A1ÿÿÿÿÿÿÿÿ+'AVA5F>NUMBER/ ï@VA% €€˜˜€‚ÿ>NUMBERj/'AÀA; F€^€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0570 >NUMBER «to-number» CORE™9VAYB` €r€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿ( ud1 c-addr1 u1 -- ud2 c-addr2 u2 )K°ÀA€E› a€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿud2 is the unsigned result of converting the characters within the string specified by c-addr1 u1 into digits, using the number in BASE, and adding each into ud1 after multiplying ud1 by the number in BASE. Conversion continues left-to-right until a character that is not convertible, including any «+» or «-», is encountered or the string is entirely converted. c-addr2 is the location of the first unconverted character or the first character past the end of the string if the string was entirely converted. u2 is the number of unconverted characters in the string. An ambiguous condition exists if ud2 overflows during the conversion. f'YB F? N€N€^Œ˜RQ³~‚9€ƒ€ƒ€ã.öÌ剀‚ÿSee:3.2.1.2 Digit conversion.+€E5F( €€R‚9€‚ÿ3 FhF1ÿÿÿÿÿÿÿÿ,hF’FaI>R*5F’F% € €˜˜€‚ÿ>R_$hFñF; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0580 >R «to-r»CORE»s’F¬GH `€æ€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( x -- ) ( R: -- x )R ñFþG2 4€@€Œ˜RQ‚9€€€‚ÿMove x to the return stack. ¬G IŒ 怀^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã®CMw€‰€€ã¯CMw€‰€€ãÛ-’À‰€€ãT¬J¿€‰€€ãU¬J¿€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.2060 R>, 6.1.2070 R@, 6.2.0340 2>R, 6.2.0410 2R>, 6.2.0415 2R@.+þG6I( €€R‚9€‚ÿ+ IaI( €€R‚9€‚ÿ56I–I1lÿÿÿÿÿÿÿÿ-–IÂIýJ?DUP,aIÂI% €€˜˜€‚ÿ?DUPj/–I,J; F€^€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0630 ?DUP «question-dupe»COREUÂIJ< H€2€Œ˜RQ‚H€€€€€€€‚ÿ( x -- 0 | x x )S#,JÔJ0 0€F€Œ˜RQ‚H€€€‚ÿDuplicate x if it is non-zero.)JýJ& €€R‚H€‚ÿ2ÔJ/K1âÿÿÿÿÿÿÿÿ./KXK M@)ýJXK% €€˜˜€‚ÿ@_$/K·K; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0650 @ «fetch»CORELXKL6 <€,€Œ˜RQ‚H€€€€€‚ÿ( a-addr -- x )Y&·K\L3 6€L€Œ˜RQ‚H€€€€‚ÿx is the value stored at a-addr.‚7LÞLK f€n€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€ãV­J¿‰€‚ÿSee:3.3.3.1 Address alignment. 6.1.0010 !+\L M( €€R‚9€‚ÿ6ÞL?M1jÿÿÿÿÿÿÿÿ/?MlM¥OABORT- MlM% €€˜˜€‚ÿABORTL?MžM/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.0670 ABORT COREUlM N6 <€>€Œ˜RQ‚H€€€€€‚ÿ( i*x -- ) ( R: j*x -- )Ÿ†žMËN8 >€ €Œ˜RQ‚H€ãòŠn€‰€‚ÿEmpty the data stack and perform the function of QUIT, which includes emptying the return stack, without displaying a message.„6 NOON l€l€^Œ˜RQ³~‚9€ƒ€€ƒ€€€€ãC\W €‚ÿSee:9.6.2.0670 ABORT, 6.1.0680 ABORT"+ËNzO( €€R‚9€‚ÿ+OO¥O( €€R‚9€‚ÿ7zOÜO1sÿÿÿÿÿÿÿÿ0ÜO€S„ABORT". ¥O€% €€˜˜€‚ÜO€¥OÿABORT"j/ÜO€€; F€^€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0680 ABORT" «abort-quote»COREºr€:H `€ä€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( «ccc» -- )³z€€í9 B€ô€Œ˜RQ‚9€€€€€‚ÿParse ccc delimited by a " (double-quote). Append the run-time semantics given below to the current definition. —C:„‚T x€†€^Œ˜RQ³~‚9€ƒ€ƒ€€€€€€€€€€€‚ÿRun-time:( i*x x1 -- | i*x ) ( R: j*x -- | j*x )®í„ƒR r€]€Œ˜RQ‚9€€€€€€€€€ãB\W €‚ÿRemove x1 from the stack. If any bit of x1 is not zero, display ccc and perform an implementation-defined abort sequence that includes the function of ABORT.€J„‚(„Z „€”€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所€€€€ãB\W €‚ÿSee:3.4.1 Parsing, 9.6.2.0680 ABORT", 6.1.0670 ABORT +„ƒS„( €€R‚9€‚ÿ4(„‡„1Vÿÿÿÿÿÿÿÿ1‡„²„ׅABS+S„²„% € €˜˜€‚ÿABS_$‡„…; F€H€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0690 ABS «abs»COREG²„X…6 <€"€Œ˜RQ‚H€€€€€‚ÿ( n -- u )V#…®…3 6€F€Œ˜RQ‚H€€€€‚ÿu is the absolute value of n.)X…ׅ& €€R‚H€‚ÿ7®…†1|ÿÿÿÿÿÿÿÿ2†<†‡ŠACCEPT. ׅ<†% €€˜˜€‚ÿACCEPTM†‰†/ .€<€‘€‚H€€€ƒƒ‚ÿ6.1.0695 ACCEPT COREb <†ë†B T€@€Œ˜RQ‚H€€€€€€€€€‚ÿ( c-addr +n1 -- +n2 )㢉†ΈA P€E€Œ˜RQ‚H€€€€€€€‚ÿReceive a string of at most +n1 characters. An ambiguous condition exists if +n1 is zero or greater than 32,767. Display graphic characters as they are received. A program that depends on the presence or absence of non-graphic characters in the string has an environmental dependency. The editing functions, if any, that the system performs in order to construct the string are implementation-defined.ùÌë†lj- (€™€Œ˜RQ‚H€‚ÿInput terminates when an implementation-defined line terminator is received. When input terminates, nothing is appended to the string, and the display is maintained in an implementation-defined way.n8Έ5Š6 <€p€Œ˜RQ‚H€€€€€‚ÿ+n2 is the length of the string stored at c-addr.)lj^Š& €€R‚H€‚ÿ)5Š‡Š& €€R‚H€‚ÿ6^ŠœŠ1ÿÿÿÿÿÿÿÿ3œŠêŠ،ALIGN-‡ŠêŠ% €€˜˜€‚ÿALIGNLœŠ6‹/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.0705 ALIGN CORE3 êŠi‹* $€€Œ˜RQ‚H€‚ÿ( -- )xN6‹á‹* $€œ€Œ˜RQ‚H€‚ÿIf the data-space pointer is not aligned, reserve enough space to align it.¡Si‹‚ŒN l€Š€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€ãG\W €‚ÿSee:3.3.3 Data space, 3.3.3.1 Address alignment, 6.1.0706 ALIGNED.+á‹­Œ( €€R‚9€‚ÿ+‚Œ،( €€R‚9€‚ÿ8­Œ1$ÿÿÿÿÿÿÿÿ4?2ALIGNED/ ،?% €€˜˜€‚ÿALIGNEDN/ .€>€‘€‚H€€€ƒƒ‚ÿ6.1.0706 ALIGNED COREO?܍6 <€2€Œ˜RQ‚H€€€€€‚ÿ( addr -- a-addr ){HWŽ3 6€€Œ˜RQ‚H€€€€‚ÿa-addr is the first aligned address greater than or equal to addr.…=܍܎H `€z€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝã‰ãF\W €‚ÿSee:3.3.3.1 Address alignment, 6.1.0705 ALIGN.+WŽ( €€R‚9€‚ÿ+܎2( €€R‚9€‚ÿ6h1Rÿÿÿÿÿÿÿÿ5h•ŸÃALLOT-2•% €€˜˜€‚ÿALLOTLhá/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.0710 ALLOT CORE= •*À0 0€€Œá*À2˜RQ‚H€€€‚ÿ( n -- )Éá>ÁK d€“€Œ˜RQ‚H€€€€€€€€€€€‚ÿIf n is greater than zero, reserve n address units of data space. If n is less than zero, release |n| address units of data space. If n is zero, leave the data-space pointer unchanged.é«*À'Â> J€W€Œ˜RQ‚H€€€€€€€‚ÿIf the data-space pointer is aligned and n is a multiple of the size of a cell when ALLOT begins execution, it will remain aligned when ALLOT finishes execution.Å>Á+Ã? L€‹€Œ˜RQ‚H€€€€€€€‚ÿIf the data-space pointer is character aligned and n is a multiple of the size of a character when ALLOT begins execution, it will remain character aligned when ALLOT finishes execution.h#'“ÃE Z€F€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝã‰ãÜ«J¿‰€‚ÿSee:3.3.3 Data space, ,++ßÃ( €€R‚9€‚ÿ4“ÃòÃ1’ÿÿÿÿÿÿÿÿ6òÃÄ~ÅAND+ŸÃÄ% € €˜˜€‚ÿANDJòÃgÄ/ .€6€‘€‚H€€€ƒƒ‚ÿ6.1.0720 AND CORE`ÄÇÄE Z€6€Œ˜RQ‚H€€€€€€€€€€‚ÿ( x1 x2 -- x3 )Ž@gÄUÅN l€€€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿx3 is the bit-by-bit logical «and» of x1 with x2.)ÇÄ~Å& €€R‚H€‚ÿ5UųÅ1tÿÿÿÿÿÿÿÿ7³ÅßÅ"ÇBASE,~ÅßÅ% €€˜˜€‚ÿBASEK³Å*Æ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.0750 BASE COREBßÅlÆ0 0€$€Œ˜RQ‚H€€€‚ÿ( -- a-addr )_*ÆùÆ. ,€Ÿ€Œ˜RQ‚H€€‚ÿa-addr is the address of a cell containing the current number-conversion radix {{2...36}}.)lÆ"Ç& €€R‚H€‚ÿ6ùÆXÇ1‡ÿÿÿÿÿÿÿÿ8XÇ…ÇÛÊBEGIN-"Ç…Ç% €€˜˜€‚ÿBEGINLXÇÑÇ/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.0760 BEGIN CORE­k…Ç~ÈB T€Ö€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: -- dest )ӟÑÇQÉ4 6€?€Œ˜RQ‚9€€€‚ÿPut the next location for a transfer of control, dest, onto the control flow stack. Append the run-time semantics given below to the current definition.H~È™É3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )BQÉÛÉ, (€,€Œ˜RQ‚9€‚ÿContinue execution.Õi™É°Êl š€Ò€^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã±CMw€‰€€ãâƖ‘€‰€€ãT£€‰€‚ÿSee:3.2.3.2 Control-flow stack, 6.1.2140 REPEAT, 6.1.2390 UNTIL, 6.1.2430 WHILE.+ÛÉÛÊ( €€R‚9€‚ÿ3°ÊË1Qÿÿÿÿÿÿÿÿ9Ë8ËXÌBL*ÛÊ8Ë% € €˜˜€‚ÿBL^#Ë–Ë; F€F€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0770 BL «b-l»CORE@8ËÖË0 0€ €Œ˜RQ‚H€€€‚ÿ( -- char )Y,–Ë/Ì- *€X€Œ˜RQ‚H€€‚ÿchar is the character value for a space.)ÖËXÌ& €€R‚H€‚ÿ3/Ì‹Ì1Kÿÿÿÿÿÿÿÿ:‹ÌµÌÏÎC!*X̵Ì% € €˜˜€‚ÿC!b'‹ÌÍ; F€N€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0850 C! «c-store»COREOµÌfÍ6 <€2€Œ˜RQ‚H€€€€€‚ÿ( char c-addr -- )Ø Í>Î8 >€A€Œ˜RQ‚H€€€€€‚ÿStore char at c-addr. When character size is smaller than cell size, only the number of low-order bits corresponding to character size are transferred.f'fÍ€Î? N€N€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀‚ÿSee:3.3.3.1 Address alignment+>ÎÏÎ( €€R‚9€‚ÿ3€ÎÏ17ÿÿÿÿÿÿÿÿ;Ï,ÏC,*ÏÎ,Ï% € €˜˜€‚ÿC,b'ÏŽÏ; F€N€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0860 C, «c-comma»CORE@,ÏÎÏ0 0€ €Œ˜RQ‚H€€€‚ÿ( char -- )•OŽÏoF Z€Ÿ€Œ˜RQ‚H€€€€ÎÏoÏ΀€€€€‚ÿReserve space for one character in the data space and store char in the space. If the data-space pointer is character aligned when C, begins execution, it will remain character aligned when C, finishes execution. An ambiguous condition exists if the data-space pointer is not character-aligned prior to execution of C,.<ÎÏðE Z€x€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€€‚ÿSee:3.3.3 Data space, 3.3.3.1 Address alignment.+o( €€R‚9€‚ÿ3ðN1(ÿÿÿÿÿÿÿÿ<NxoC@*x% € €˜˜€‚ÿC@b'NÚ; F€N€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0870 C@ «c-fetch»COREOx)6 <€2€Œ˜RQ‚H€€€€€‚ÿ( c-addr -- char )ŒŠÚå2 2€€Œ˜RQ‚H€€€‚ÿFetch the character stored at c-addr. When the cell size is greater than character size, the unused high-order bits are all zeroes._&)D9 B€L€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿSee:3.3.3.1 Address alignment.+åo( €€R‚9€‚ÿ6D¥18ÿÿÿÿÿÿÿÿ=¥ÒÙCELL+-oÒ% €€˜˜€‚ÿCELL+g,¥9; F€X€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0880 CELL+ «cell-plus»CORE[Ò”< H€>€Œ˜RQ‚H€€€€€€€‚ÿ( a-addr1 -- a-addr2 )ˆL9< H€˜€Œ˜RQ‚H€€€€€€€‚ÿAdd the size in address units of a cell to a-addr1, giving a-addr2.g(”ƒ? N€P€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀‚ÿSee:3.3.3.1 Address alignment.+®( €€R‚9€‚ÿ+ƒÙ( €€R‚9€‚ÿ6®1ÿÿÿÿÿÿÿÿ><˜CELLS-Ù<% €€˜˜€‚ÿCELLSLˆ/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.0890 CELLS COREQ<Ù< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( n1 -- n2 )m4ˆF9 B€h€Œ˜RQ‚H€€€€€€‚ÿn2 is the size in address units of n1 cells.)Ùo& €€R‚H€‚ÿ)F˜& €€R‚H€‚ÿ5oÍ1|ÿÿÿÿÿÿÿÿ?ÍùD CHAR,˜ù% €€˜˜€‚ÿCHARa&ÍZ ; F€L€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0895 CHAR «char»CORE_#ù¹ < H€F€Œ˜RQ‚H€€€€€€€‚ÿ( «name» -- char )­|Z f 1 2€ø€Œ˜RQ‚H€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Put the value of its first character onto the stack.ˆ4¹ î T x€h€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所€ã7²Ý󀉀€‚ÿSee:3.4.1 Parsing, 6.1.2520 [CHAR].+f  ( €€R‚9€‚ÿ+î D ( €€R‚9€‚ÿ6 z 1=ÿÿÿÿÿÿÿÿ@z § ³ CHAR+-D § % €€˜˜€‚ÿCHAR+g,z  ; F€X€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0897 CHAR+ «char-plus»CORE[§ i < H€>€Œ˜RQ‚H€€€€€€€‚ÿ( c-addr1 -- c-addr2 )Q ö < H€¢€Œ˜RQ‚H€€€€€€€‚ÿAdd the size in address units of a character to c-addr1, giving c-addr2.g(i ] ? N€P€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀‚ÿSee:3.3.3.1 Address alignment.+ö ˆ ( €€R‚9€‚ÿ+] ³ ( €€R‚9€‚ÿ6ˆ é 1©ÿÿÿÿÿÿÿÿAé ŽCHARS-³ % €€˜˜€‚ÿCHARSc(é y; F€P€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0898 CHARS «chars»COREQÊ< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( n1 -- n2 )r9y<9 B€r€Œ˜RQ‚H€€€€€€‚ÿn2 is the size in address units of n1 characters.)Êe& €€R‚H€‚ÿ)<Ž& €€R‚H€‚ÿ9eÇ1WÿÿÿÿÿÿÿÿBÇ @CCONSTANT0 Ž @% €€˜˜€‚ÿCONSTANTÇ @ŽO Ç[@/ .€@€‘€‚H€€€ƒƒ‚ÿ6.1.0950 CONSTANT CORE\ @·@< H€@€Œ˜RQ‚H€€€€€€€‚ÿ( x «name» -- )ʒ[@A8 >€%€Œ˜RQ‚H€€€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Create a definition for name with the execution semantics defined below.e,·@æA9 B€X€Œ˜RQ‚H€€€€€€‚ÿname is referred to as a «constant».`!AFB? N€B€^Œ˜RQ³~‚9€ƒ€€€ƒ€€‚ÿname Execution:( -- x )LæA’B2 4€4€Œ˜RQ‚9€€€‚ÿPlace x on the stack._FBñBB T€:€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所‚ÿSee:3.4.1 Parsing.+’BC( €€R‚9€‚ÿ6ñBRC1|ÿÿÿÿÿÿÿÿCRCCÊECOUNT-CC% €€˜˜€‚ÿCOUNTLRCËC/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.0980 COUNT COREd#C/DA R€F€˜RS‚H€€€€€€€€€‚ÿ( c-addr1 -- c-addr2 u )rËC¡E_ Œ€'€˜RS‚H€€€€€€€€€€€€€€€€€€‚ÿReturn the character string specification for the counted string stored at c-addr1. c-addr2 is the address of the first character after c-addr1. u is the contents of the character at c-addr1, which is the length in characters of the string at c-addr2.)/DÊE& €€R‚H€‚ÿ3¡EýE1ZÿÿÿÿÿÿÿÿDýE'FPGCR*ÊE'F% € €˜˜€‚ÿCR^#ýE…F; F€F€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.0990 CR «c-r»CORE2 'F·F) "€€˜RS‚H€‚ÿ( -- )pG…F'G) "€Ž€˜RS‚H€‚ÿCause subsequent output to appear at the beginning of the next line.)·FPG& €€R‚H€‚ÿ7'G‡G1NÿÿÿÿÿÿÿÿE‡GµGÒKCREATE. PGµG% €€˜˜€‚ÿCREATEM‡GH/ .€<€‘€‚H€€€ƒƒ‚ÿ6.1.1000 CREATE COREQµGSH5 :€8€˜RS‚H€€€€€‚ÿ( «name» -- )±`HJQ p€Á€˜RS‚H€€€€€€€€€€€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Create a definition for name with the execution semantics defined below. If the data-space pointer is not aligned, reserve enough data space to align it. The new data-space pointer defines name’s data field. CREATE does not allocate data space in name’s data field.e&SHiJ? N€L€^Œ˜RQ³~‚9€ƒ€€€ƒ€€‚ÿname Execution:( -- a-addr )ŒxJ%KD X€ð€˜RS‚9€€€€€€€€€‚ÿa-addr is the address of name’s data field. The execution semantics of name may be extended by using DOES>.‚4iJ§KN l€h€^Œ˜RQ³~‚9€ƒ€ƒ€ãæûÝ㉀€ãwß ü€‰€‚ÿSee:3.3.3 Data space, 6.1.1250 DOES>.+%KÒK( €€R‚9€‚ÿ8§K L18ÿÿÿÿÿÿÿÿF L9L@MDECIMAL/ ÒK9L% €€˜˜€‚ÿDECIMALN L‡L/ .€>€‘€‚H€€€ƒƒ‚ÿ6.1.1170 DECIMAL CORE2 9L¹L) "€€˜RS‚H€‚ÿ( -- )^5‡LM) "€j€˜RS‚H€‚ÿSet the numeric conversion radix to ten (decimal).)¹L@M& €€R‚H€‚ÿ6MvM1‚ÿÿÿÿÿÿÿÿGvM£MôNDEPTH-@M£M% €€˜˜€‚ÿDEPTHLvMïM/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.1200 DEPTH CORE=£M,N/ .€€˜RS‚H€€€‚ÿ( -- +n )ŸlïMËN3 6€Ø€˜RS‚H€€€€‚ÿ+n is the number of single-cell values contained in the data stack before +n was placed on the stack.),NôN& €€R‚H€‚ÿ3ËN'O1iÿÿÿÿÿÿÿÿH'OQO„DO*ôNQO% € €˜˜€‚ÿDOI'OšO/ .€4€‘€‚H€€€ƒƒ‚ÿ6.1.1240 DO CORE|JQO"€2 4€”€\˜RS±~‚9€ƒ€ƒ‚ÿInterpretation:Interpretation semantics for thisšO"€ôN word are undefined.]$šO€9 B€H€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿCompilation:( C: -- do-sys ) Í"€Œ@ N€›€˜RS‚9€€€€€€€‚ÿPlace do-sys onto the control-flow stack. Append the run-time semantics given below to the current definition. The semantics are incomplete until resolved by a consumer of do-sys such as LOOP.ŸB€+‚] Š€„€^Œ˜RQ³~‚9€ƒ€ƒ€€€€€€€€€€€€€€‚ÿRun-time:( n1|u1 n2|u2 -- ) ( R: -- loop-sys )‹Œ¶ƒv º€+€˜RS‚9€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿSet up loop control parameters with index n2|u2 and limit n1|u1. An ambiguous condition exists if n1|u1 and n2|u2 are not both the same type. Anything already on the return stack becomes unavailable until the loop-control parameters are discarded.®R+‚d„\ ˆ€€€\ŒRS±~‚9€ƒ€ƒ€ã£ËÑ所€ãK=ºB€‰€€ãN=ºB€‰€‚ÿSee:3.2.3.2 Control-flow stack, 6.1.0140 +LOOP, 6.1.1800 LOOP.+¶ƒ„( €€R‚9€‚ÿ6d„ń1ÄÿÿÿÿÿÿÿÿIńò„…DOES>-„ò„% €€˜˜€‚ÿDOES>b'ńT…; F€N€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.1250 DOES> «does»COREπò„#†O l€€^Œ˜RQ³~‚9€ƒ€ƒ‚ƒ€€ƒ€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: colon-sys1 -- colon-sys2 )FT…³‡J b€€˜RS‚9€€€€€€€€€€‚ÿAppend the run-time semantics below to the current definition. Whether or not the current definition is rendered findable in the dictionary by the compilation of DOES> is implementation defined. Consume colon-sys1 and produce colon-sys2. Append the initiation semantics given below to the current definition.h,#†ˆ< H€X€^Œ˜RQ³~‚9€ƒ€ƒ€€€‚ÿRun-time:( -- ) ( R: nest-sys1 -- )šD³‡µ‰V z€‰€˜RS‚9€€€€€€€€€€€€€€‚ÿReplace the execution semantics of the most recent definition, referred to as name, with the name execution semantics given below. Return control to the calling definition specified by nest-sys1. An ambiguous condition exists if name was not defined with CREATE or a user-defined word that calls CREATE.—FˆLŠQ r€Œ€^Œ˜RQ³~‚9€ƒ€€ƒ€€€€€€€€€‚ÿInitiation:( i*x -- i*x a-addr ) ( R: -- nest-sys2 )õ‰[‹L f€‡€˜RS‚9€€€€€€€€€€€‚ÿSave implementation-dependent information nest-sys2 about the calling definition. Place name’s data field address on the stack. The stack effects i*x represent arguments to name.n)LŠɋE Z€R€^Œ˜RQ³~‚9€ƒ€€€ƒ€€€€‚ÿname Execution:( i*x -- j*x )0ä[‹ùŒL f€É€˜RS‚9€€€€€€€€€€€‚ÿExecute the portion of the definition that begins with the initiation semantics appended by the DOES> which modified name. The stack effects i*x and j*x represent arguments to and results from name, respectively.aɋZB T€>€^Œ˜RQ³~‚9€ƒ€ƒ€ã6²Ý󀉀‚ÿSee:6.1.1000 CREATE.+ùŒ…( €€R‚9€‚ÿ5Zº1-ÿÿÿÿÿÿÿÿJºæâŽDROP,…æ% €€˜˜€‚ÿDROPKº1Ž/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1260 DROP CORE< æmŽ/ .€€˜RS‚H€€€‚ÿ( x -- )L1Ž¹Ž/ .€:€˜RS‚H€€€‚ÿRemove x from the stack.)mŽâŽ& €€R‚H€‚ÿ4¹Ž1JÿÿÿÿÿÿÿÿKAuÀDUP+âŽA% € €˜˜€‚ÿDUP`%¡; F€J€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.1290 DUP «dupe»COREPA À; F€*€˜RS‚H€€€€€€€‚ÿ( x -- x x )¡ ÀâŽ@¡LÀ/ .€"€˜RS‚H€€€‚ÿDuplicate x.) ÀuÀ& €€R‚H€‚ÿ5LÀªÀ1^ÿÿÿÿÿÿÿÿLªÀÖÀÅELSE,uÀÖÀ% €€˜˜€‚ÿELSEKªÀ!Á/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1310 ELSE COREÄvÖÀåÁN l€ì€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: orig1 -- orig2 )±`!Á–ÃQ p€Á€˜RS‚9€€€€€€€€€€€€‚ÿPut the location of a new unresolved forward reference orig2 onto the control flow stack. Append the run-time semantics given below to the current definition. The semantics will be incomplete until orig2 is resolved (e.g., by THEN). Resolve the forward reference orig1 using the location following the appended run-time semantics.HåÁÞÃ3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )~J–Ã\Ä4 8€”€˜RS‚9€€€€‚ÿContinue execution at the location given by the resolution of orig2.|.ÞÃØÄN l€\€^Œ˜RQ³~‚9€ƒ€ƒãºp(€‰€€ã#›Óˆ€‰€‚ÿSee:6.1.1700 IF, 6.1.2270 THEN.+\ÄÅ( €€R‚9€‚ÿ5ØÄ8Å1ÿÿÿÿÿÿÿÿM8ÅdÅLÉEMIT,ÅdÅ% €€˜˜€‚ÿEMITK8ůÅ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1320 EMIT CORE= dÅìÅ0 0€€Œ˜RQ‚H€€€‚ÿ( x -- )욯ÅØÆD V€Q€Œ˜RQ‚H€€€€€€€€€‚ÿIf x is a graphic character in the implementation-defined character set, display x. The effect of EMIT for all other values of x is implementation-defined.æ«ìÅŸÈ; D€W€Œ˜RQ‚H€€€€€‚ÿWhen passed a character whose character-defining bits have a value between hex 20 and 7E inclusive, the corresponding standard character, specified by 3.1.2.1 Graphic characters, is displayed. Because different output devices can respond differently to control characters, programs that use control characters to perform specific functions have an environmental dependency. Each EMIT deals with only one character.cØÆ!ÉE Z€<€^Œ˜RQ³~‚9€ƒ€ƒ€€ã$›Óˆ€‰€‚ÿSee:6.1.2310 TYPE.+ŸÈLÉ( €€R‚9€‚ÿ= !ɉÉ1þÿÿÿÿÿÿÿÿN‰ÉœÉŠÍENVIRONMENT?4LÉœÉ% €€˜˜€‚ÿENVIRONMENT?v;‰É3Ê; F€v€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.1345 ENVIRONMENT? «environment-query»COREu-œÉšÊH `€Z€Œ˜RQ‚H€€€€€€€€€€€‚ÿ( c-addr u -- false | i*x true )¹U3ÊaÍd –€«€Œ˜RQ‚H€€€€€€€€€ãq¹䉀€€€€€€‚ÿc-addr is the address of a character string and u is the string’s character count. u may have a value in the range from zero to an implementation-defined maximum which shall not be less than 31. The character string should contain a keyword from 3.2.6 Environmental queries or the optional word sets to be checked for correspondence with an attribute of the present environment. If the system treats the attribute as unknown, the returned flag is false; otherwise, the flag is true and the i*x returned is of the type specified in the table for the attribute queried.)šÊŠÍ& €€R‚H€‚ÿ9aÍÃÍ1âÿÿÿÿÿÿÿÿOÃÍó͘EVALUATE0 ŠÍóÍ% €€˜˜€‚ÿEVALUATEO ÃÍBÎ/ .€@€‘€‚H€€€ƒƒ‚ÿ6.1.1360 EVALUATE COREd"óÍŠÎB T€D€Œ˜RQ‚H€€€€€€€€€‚ÿ( i*x c-addr u -- j*x )ºhBÎlR r€Ñ€Œ˜RQ‚H€ãµo‚‚€‰€€€€€€€€€‚ÿSave the current input source specification. Store minus-one (-1) in SOURCE-ID if it is present. Make the string described by c-addr and u both the input source and input buffer, set >IN to zero, and interpret. When the parse area is empty, restoreŠÎlŠÍ the prior input source specification. Other stack effects are due to the words EVALUATEd.)ŠÎ•& €€R‚H€‚ÿNlã/ .€>€‘€‚H€€€ƒƒ‚ÿ6.1.1370 EXECUTE COREV•9< H€4€Œ˜RQ‚H€€€€€€€‚ÿ( i*x xt -- j*x )¶ãï7 >€þ€Œ˜RQ‚H€€€€€‚ÿRemove xt from the stack and perform the semantics identified by it. Other stack effects are due to the word EXECUTEd.~-9mQ r€Z€^Œ˜RQ³~‚9€ƒ€ƒ€ãY­J¿€‰€€ã-¬J¿€‰€‚ÿSee:6.1.0070 ', 6.1.2510 ['].+ï˜( €€R‚9€‚ÿ5mÍ1åÿÿÿÿÿÿÿÿPÍù­EXIT,˜ù% €€˜˜€‚ÿEXITKÍD/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1380 EXIT CORE¶tùúB T€è€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- ) ( R: nest-sys -- )ýŒD÷A P€y€Œ˜RQ‚9€€€€€€€‚ÿReturn control to the calling definition specified by nest-sys. Before executing EXIT within a do-loop, a program shall discard the loop-control parameters by executing UNLOOP.‹:ú‚Q r€t€^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€€ãáƖ‘€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.2380 UNLOOP.+÷­( €€R‚9€‚ÿ5‚â1¶ÿÿÿÿÿÿÿÿQâ“FILL,­% €€˜˜€‚ÿFILLKâY/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1540 FILL COREY²< H€:€Œ˜RQ‚H€€€€€€€‚ÿ( c-addr u char -- )·tYiC V€è€Œ˜RQ‚H€€€€€€€€€‚ÿIf u is greater than zero, store char in each of u consecutive characters of memory beginning at c-addr.*²“' €€ ˜R‚H€‚ÿ5iÈ1îÿÿÿÿÿÿÿÿRÈô± FIND,“ô% €€˜˜€‚ÿFINDKÈ?/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1550 FIND COREw5ô¶B T€j€Œ˜RQ‚H€€€€€€€€€‚ÿ( c-addr -- c-addr 0 | xt 1 | xt -1 ) ֏?Œ G \€€Œ˜RQ‚H€€€€€€€€€‚ÿFind the definition named in the counted string at c-addr. If the definition is not found, return c-addr and zero. If the definition is found, return its execution token xt. If the definition is immediate, also return one (1), otherwise also return minus-one (-1). For a given string, the values returned by FIND while compiling may differ from those returned while not compiling.ù„¶… u ž€ €^Œ˜RQ³~‚9€ƒ€ƒ€ã«4䉀€ãY­J¿€‰€€ã-¬J¿€‰€€ã7ìÆe€‰€€€‚ÿSee:3.4.2 Finding definition names, A.6.1.0070 ', A.6.1.2510 ['], A.6.1.2033 POSTPONE, D.6.7 Immediacy.,Œ ± ) "€€ ˜R‚9€‚ÿ7… è 1JÿÿÿÿÿÿÿÿSè  /FM/MOD. ±  % €€˜˜€‚ÿFM/MODl1è ‚ ; F€b€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.1561 FM/MOD «f-m-slash-mod»COREo! ñ N l€B€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿ( d1 n1 -- n2 n3 )^‚ O] ˆ€€Œ˜RQ‚H€€€€€€€€€€€€€€€€€‚ÿDivide d1 by n1, giving the floored quotient n3 and the remainder n2. Input and output stack arguments are signed. An ambiguous condition exists if n1 is zero or if the quotient lies outside the range of a single-cell signed integer. ŽTñ ` €š€^Œ˜RQ³~‚9€ƒ€€ƒ€ã1Ë&㉀€ãíïW„€‰€€ãîqٔ€‰€‚ÿSee:3.2.2.1 Integer division, 6.1.2214 SM/REM, 6.1.2370 UM/MOD.,O/) "€€ ˜R‚9€‚ÿ5d1¥ÿÿÿÿÿÿÿÿTdAHERE,/% €€˜˜€‚ÿHEREKdÛ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1650 HERE CORE@'@0 0€ €Œ˜RQ‚HÛ'@/€€€‚ÿ( -- addr )P#Ûw@- *€F€Œ˜RQ‚H€€‚ÿaddr is the data-space pointer.l*'@ã@B T€T€^Œ˜RQ³~‚9€ƒ€€ƒ€ãæûÝ㉀‚ÿSee:3.3.3.2 Contiguous regions.,w@A) "€€ ˜R‚9€‚ÿ5ã@DA1ÞÿÿÿÿÿÿÿÿUDApACHOLD,ApA% €€˜˜€‚ÿHOLDKDA»A/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1670 HOLD CORE@pAûA0 0€ €Œ˜RQ‚H€€€‚ÿ( char -- )ø®»AóBJ b€]€Œ˜RQ‚H€€€€€ã2¬J¿€‰ãX­J¿‰€‚ÿAdd char to the beginning of the pictured numeric output string. An ambiguous condition exists if HOLD executes outside of a <# #> delimited number conversion.*ûAC' €€ ˜R‚H€‚ÿ2óBOC1CÿÿÿÿÿÿÿÿVOCxCŠEI)CxC% €€˜˜€‚ÿIHOCÀC/ .€2€‘€‚H€€€ƒƒ‚ÿ6.1.1680 I COREމxCžDU x€€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- n|u ) ( R: loop-sys -- loop-sys )ÁŠÀC_E7 <€€Œ˜RQ‚9€€€€‚ÿn|u is a copy of the current (innermost) loop index. An ambiguous condition exists if the loop control parameters are unavailable.+žDŠE( €€R‚9€‚ÿ3_EœE11ÿÿÿÿÿÿÿÿWœEçEçIIF*ŠEçE% € €˜˜€‚ÿIFIœE0F/ .€4€‘€‚H€€€ƒƒ‚ÿ6.1.1700 IF CORE­kçEÝFB T€Ö€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: -- orig )=÷0FHF Z€ï€˜RS‚9€€€€€€€€€‚ÿPut the location of a new unresolved forward reference orig onto the control flow stack. Append the run-time semantics given below to the current definition. The semantics are incomplete until orig is resolved, e.g., by THEN or ELSE.RÝFlH9 B€2€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( x -- )¢jHI8 @€Ô€˜RS‚9€€€€€‚ÿIf all bits of x are zero, continue execution at the location specified by the resolution of orig.®QlHŒI] Š€¢€^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã. d€‰€€ã#›Óˆ€‰€‚ÿSee:3.2.3.2 Control flow stack, 6.1.1310 ELSE, 6.1.2270 THEN.+IçI( €€R‚9€‚ÿ: ŒI!J1èÿÿÿÿÿÿÿÿX!JRJ LIMMEDIATE1 çIRJ% €€˜˜€‚ÿIMMEDIATEP!!J¢J/ .€B€‘€‚H€€€ƒƒ‚ÿ6.1.1710 IMMEDIATE CORE3 RJÕJ* $€€Œ˜RQ‚H€‚ÿ( -- )Ž‰¢J‰K+ $€€˜RS‚H€‚ÿMake the most recent definition an immediate word. An ambiguous condition exists if the most recent definition does not have a name.UÕJÞK9 B€8€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿSee:D.6.7 Immediacy.+‰K L( €€R‚9€‚ÿ7ÞK@L1õÿÿÿÿÿÿÿÿY@LnL2NINVERT. LnL% €€˜˜€‚ÿINVERTM@L»L/ .€<€‘€‚H€€€ƒƒ‚ÿ6.1.1720 INVERT COREQnL M< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( x1 -- x2 )y>»L…M; F€|€˜RS‚H€€€€€€€‚ÿInvert all bits of x1, giving its logical inverse x2.‚1 MNQ r€b€^Œ˜RQ³~‚9€ƒ€ƒ€ã”@T€‰€€ãØ«J¿€‰€‚ÿSee:6.1.1910 NEGATE, 6.1.0270 0=.+…M2N( €€R‚9€‚ÿ2NdN1*ÿÿÿÿÿÿÿÿZdNNJ)2NN% €€˜˜€‚ÿJHdNÕN/ .€2€‘€‚H€€€ƒƒ‚ÿ6.1.1730 J CORE¥N €m š€K€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€€€€€€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- n|u ) ( R: loop-sys1 loop-sys2 -- loop-sys1 loop-sys2 )ÕN €2Næ§ÕNò€? L€O€˜RS‚9€€€€€€€‚ÿn|u is a copy of the next-outer loop index. An ambiguous condition exists if the loop control parameters of the next-outer loop, loop-sys1, are unavailable.+ €( €€R‚9€‚ÿ4ò€Q16ÿÿÿÿÿÿÿÿ[Q|…KEY+|% € €˜˜€‚ÿKEYJQƁ/ .€6€‘€‚H€€€ƒƒ‚ÿ6.1.1750 KEY CORE@|‚0 0€ €Œ˜RQ‚H€€€‚ÿ( -- char )(õƁ.ƒ3 4€ë€Œ˜RQ‚H€€€‚ÿReceive one character char, a member of the implementation-defined character set. Keyboard events that do not correspond to such characters are discarded until a valid character is received, and those events are subsequently unavailable.Ž]‚Œƒ1 2€º€Œ˜RQ‚H€€€‚ÿAll standard characters can be received. Characters received by KEY are not displayed.Ó.ƒ΄? L€§€Œ˜RQ‚H€€€€ãȫ㉀‚ÿAny standard character returned by KEY has the numeric value specified in 3.1.2.1 Graphic characters. Programs that require the ability to receive control characters have an environmental dependency.ˆ7ŒƒV…Q r€n€^Œ˜RQ³~‚9€ƒ€ƒ€ãóLq€€‰€€ãôLq€€‰€‚ÿSee:10.6.2.1307 EKEY, 10.6.1.1755 KEY?.+΄…( €€R‚9€‚ÿ6V…·…1<ÿÿÿÿÿÿÿÿ\·…ä…ïˆLEAVE-…ä…% €€˜˜€‚ÿLEAVEL·…0†/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.1760 LEAVE CORE¶tä…æ†B T€è€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- ) ( R: loop-sys -- )5â0†ˆS t€Å€Œ˜RQ‚9€ãvß ü€‰ãN=ºB‰€ãvß ü€‰ãK=ºB‰€‚ÿDiscard the current loop control parameters. An ambiguous condition exists if they are unavailable. Continue execution immediately following the innermost syntactically enclosing DO ... LOOP or DO ... +LOOP.©Læ†Ĉ] Š€˜€^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ãK=ºB€‰€€ãN=ºB€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.0140 +LOOP, 6.1.1800 LOOP.+ˆïˆ( €€R‚9€‚ÿ8Ĉ'‰1bÿÿÿÿÿÿÿÿ]'‰V‰‡‹LITERAL/ ïˆV‰% €€˜˜€‚ÿLITERALN'‰€‰/ .€>€‘€‚H€€€ƒƒ‚ÿ6.1.1780 LITERAL CORE§eV‰KŠB T€Ê€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( x -- )sG€‰ŸŠ, (€Ž€Œ˜RQ‚9€‚ÿAppend the run-time semantics given below to the current definition.RKŠ‹9 B€2€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( -- x )LŸŠ\‹2 4€4€Œ˜RQ‚9€€€‚ÿPlace x on the stack.+‹‡‹( €€R‚9€‚ÿ5\‹Œ‹1Cÿÿÿÿÿÿÿÿ^Œ‹è‹ÿÀLOOP,‡‹è‹% €€˜˜€‚ÿLOOPKŒ‹3Œ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1800 LOOP CORE¯mè‹âŒB T€Ú€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: do-sys -- )a3ŒCŽN j€'€Œ˜RQ‚9€ãL=ºB€‰€€€ãN=ºB€‰€‚ÿAppend the run-time semantics given below to the current definition. Resolve the destination of all unresolved occurrences of LEAVE between the location given by do-sys and the next location for a transfer of control, to execute the words following the LOOP.‚=âŒŎE Z€z€^Œ˜RQ³~‚9€ƒ€ƒ€€€€€€‚ÿRun-time:( -- ) ( R: loop-sys1 -- | loop-sys2 )b2CŽ3À0 .€e€Œ˜RQ‚9€‚ÿAn ambiguous condition exists if the loop control parameters are unavailable. Add one to the loop index. If the loop index is then equal to the loop limit, discard the loop parameters and continue execution immediately following the loop. Otherwise continue exŎ3À‡‹ecution at the beginning of the loop.¡AŎÔÀ` €‚€^Œ˜RQ³~‚9€ƒ€ƒ€ãvß ü€‰€€ãºp(€‰€€ãL=ºB€‰€‚ÿSee:6.1.1240 DO, 6.1.1680 I, 6.1.1760 LEAVE.+3ÀÿÀ( €€R‚9€‚ÿ7ÔÀ6Á1³ÿÿÿÿÿÿÿÿ_6ÁdÁæÃLSHIFT. ÿÀdÁ% €€˜˜€‚ÿLSHIFTf+6ÁÊÁ; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.1805 LSHIFT «l-shift»CORE[dÁ%ÂB T€2€Œ˜RQ‚H€€€€€€€€€‚ÿ( x1 u -- x2 )8íÊÁ]ÃK d€Û€Œ˜RQ‚H€€€€€€€€€€€‚ÿPerform a logical left shift of u bit-places on x1, giving x2. Put zeroes into the least significant bits vacated by the shift. An ambiguous condition exists if u is greater than or equal to the number of bits in a cell.^%»Ã? N€>€^Œ˜RQ³~‚9€ƒ€ƒ€ã³CMw‰€‚ÿSee:6.1.2162 RSHIFT+]ÃæÃ( €€R‚9€‚ÿ3»ÃÄ1†ÿÿÿÿÿÿÿÿ`ÄCĘÅM**æÃCÄ% € €˜˜€‚ÿM*a&Ä€Ä; F€L€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.1810 M* «m-star»CORE[CÄÿÄB T€2€Œ˜RQ‚H€€€€€€€€€‚ÿ( n1 n2 -- d )p1€ÄoÅ? N€b€Œ˜RQ‚H€€€€€€€€‚ÿd is the signed product of n1 times n2.)ÿĘÅ& €€R‚H€‚ÿ4oÅÌÅ1qÿÿÿÿÿÿÿÿaÌÅ÷Å7ÇMAX+˜Å÷Å% € €˜˜€‚ÿMAXJÌÅAÆ/ .€6€‘€‚H€€€ƒƒ‚ÿ6.1.1870 MAX CORE`÷Å¡ÆE Z€6€Œ˜RQ‚H€€€€€€€€€€‚ÿ( n1 n2 -- n3 )l*AÆ ÇB T€T€Œ˜RQ‚H€€€€€€€€€‚ÿn3 is the greater of n1 and n2.*¡Æ7Ç' €€ ŒR‚H€‚ÿ4 ÇkÇ1pÿÿÿÿÿÿÿÿbkÇ–ÇÕÈMIN+7Ç–Ç% € €˜˜€‚ÿMINJkÇàÇ/ .€6€‘€‚H€€€ƒƒ‚ÿ6.1.1880 MIN CORE`–Ç@ÈE Z€6€Œ˜RQ‚H€€€€€€€€€€‚ÿ( n1 n2 -- n3 )k)àÇ«ÈB T€R€Œ˜RQ‚H€€€€€€€€€‚ÿn3 is the lesser of n1 and n2.*@ÈÕÈ' €€ ŒR‚H€‚ÿ4«È É1ÿÿÿÿÿÿÿÿc É4ÉÌMOD+ÕÈ4É% € €˜˜€‚ÿMODJ É~É/ .€6€‘€‚H€€€ƒƒ‚ÿ6.1.1890 MOD CORE`4ÉÞÉE Z€6€Œ˜RQ‚H€€€€€€€€€€‚ÿ( n1 n2 -- n3 )ª:~ɈËp ®€u€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€‚ÿDivide n1 by n2, giving the single-cell remainder n3. An ambiguous condition exists if n2 is zero. If n1 and n2 differ in sign, the implementation-defined result returned will be the same as that returned by either the phrase >R S>D R> FM/MOD DROP or the phrase >R S>D R> SM/REM DROP.f'ÞÉîË? N€N€^Œ˜RQ³~‚9€ƒ€ƒ€ã1Ë&㉀‚ÿSee:3.2.2.1 Integer division.,ˆËÌ) "€€ ŒR‚9€‚ÿ5îËOÌ12ÿÿÿÿÿÿÿÿdOÌ{Ì|ÏMOVE,Ì{Ì% €€˜˜€‚ÿMOVEKOÌÆÌ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1900 MOVE COREa{Ì'ÍB T€>€Œ˜RQ‚H€€€€€€€€€‚ÿ( addr1 addr2 u -- )®8ÆÌÕÎv º€q€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿIf u is greater than zero, copy the contents of u consecutive address units at addr1 to the u consecutive address units at addr2. After MOVE completes, the u consecutive address units at addr2 contain exactly what the u consecutive address units at addr1 contained before the move.{6'ÍPÏE Z€l€^Œ˜RQ³~‚9€ƒ€ƒ€€€€€€‚ÿSee:17.6.1.0910 CMOVE, 17.6.1.0920 CMOVE>.,ÕÎ|Ï) "€€ ŒR‚9€‚ÿ7PϳÏ1úÿÿÿÿÿÿÿÿe³ÏáϬNEGATE. |ÏáÏ% €€˜˜€‚ÿNEGATEM³Ï:/ .€<€‘áÏ:|Ï€‚H€€€ƒƒ‚ÿ6.1.1910 NEGATE COREQáÏ‹< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( n1 -- n2 )s7:þ< H€n€Œ˜RQ‚H€€€€€€€‚ÿNegate n1, giving its arithmetic inverse n2. ‚1‹€Q r€b€^Œ˜RQ³~‚9€ƒ€ƒ€ãºp(€‰€€ãØ«J¿€‰€‚ÿSee:6.1.1720 INVERT, 6.1.0270 0=.,þ¬) "€€ ŒR‚9€‚ÿ3€ß1ÿÿÿÿÿÿÿÿfß YOR*¬ % € €˜˜€‚ÿORIßR/ .€4€‘€‚H€€€ƒƒ‚ÿ6.1.1980 OR CORE` ²E Z€6€Œ˜RQ‚H€€€€€€€€€€‚ÿ( x1 x2 -- x3 )};R/B T€v€Œ˜RQ‚H€€€€€€€€€‚ÿx3 is the bit-by-bit inclusive-or of x1 with x2.*²Y' €€ ŒR‚H€‚ÿ5/Ž1ƒÿÿÿÿÿÿÿÿgŽº OVER,Yº% €€˜˜€‚ÿOVERKŽ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.1990 OVER CORE~'ºƒW ~€N€Œ˜RQ‚H€€€€€€€€€€€€€€€€‚ÿ( x1 x2 -- x1 x2 x1 )`-ã3 6€Z€Œ˜RQ‚H€€€€‚ÿPlace a copy of x1 on top of the stack.)ƒ & €€R‚H€‚ÿ9ãE1äÿÿÿÿÿÿÿÿhEu(POSTPONE0 u% €€˜˜€‚ÿPOSTPONEO EÄ/ .€@€‘€‚H€€€ƒƒ‚ÿ6.1.2033 POSTPONE COREŒtu€H `€è€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( «name» -- )ÓÄšG \€§€Œ˜RQ‚9€€€€€€€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Find name. Append the compilation semantics of name to the current definition. An ambiguous condition exists if name is not found.c€ýE Z€<€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所€‚ÿSee:3.4.1 Parsing.+š(( €€R‚9€‚ÿ5ý]1œÿÿÿÿÿÿÿÿi]‰ QUIT,(‰% €€˜˜€‚ÿQUITK]Ô/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.2050 QUIT COREK‰ 0 0€6€Œ˜RQ‚H€€€‚ÿ( -- ) ( R: i*x -- )úÇÔ 3 4€€Œ˜RQ‚H€€€‚ÿEmpty the return stack, store zero in SOURCE-ID if it is present, make the user input device the input source, and enter interpretation state. Do not display a message. Repeat the following:—d ° 3 6€È€Œ°Ÿ‚H€€€€‚ÿ–  Accept a line from the input source into the input buffer, set >IN to zero, and interpret.ʜ z . *€9€Œ°Ÿ‚H€€‚ÿ–  Display the implementation-defined system prompt if in interpretation state, all processing has been completed, and no ambiguous condition exists. p.° ê B T€\€^Œ˜RQ³~‚9€ƒ€€ƒ€ã€á牀‚ÿSee:3.4 The Forth text interpreter.+z  ( €€R‚9€‚ÿ3ê H 1ëÿÿÿÿÿÿÿÿjH r ,R>* r % € €˜˜€‚ÿR>a&H Ó ; F€L€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2060 R> «r-from»CORE»sr Ž H `€æ€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- x ) ( R: x -- )f4Ó ô 2 4€h€Œ˜RQ‚9€€€‚ÿMove x from the return stack to the data stack. Ž Œ 怀^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã®CMw€‰€€ã¯CMw€‰€€ãÛ-’À‰€€ãT¬J¿€‰€€ãU¬J¿€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.0580 >R, 6.1.2070 R@, 6.2.0340 2>R, 6.2.0410 2R>, 6.2.0415 2R@.+ô ,( €€R‚9€‚ÿ3_1]ÿÿÿÿÿÿÿÿk_‰oBR@*,‰% € €˜˜€‚ÿR@b'_ @; F€N€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2070 R@ «r-fetch»CORE‰ @,Åw‰Ñ@N l€î€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- x ) ( R: x -- x )f4 @7A2 4€h€Œ˜RQ‚9€€€‚ÿCopy x from the return stack to the data stack. Ñ@DBŒ 怀^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã®CMw€‰€€ã®CMw€‰€€ãÛ-’À‰€€ãT¬J¿€‰€€ãU¬J¿€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.0580 >R, 6.1.2060 R>, 6.2.0340 2>R, 6.2.0410 2R>, 6.2.0415 2R@.+7AoB( €€R‚9€‚ÿ8DB§B1±ÿÿÿÿÿÿÿÿl§BÖBVERECURSE/ oBÖB% €€˜˜€‚ÿRECURSEN§B$C/ .€>€‘€‚H€€€ƒƒ‚ÿ6.1.2120 RECURSE COREaÖBÁC< H€Â€^Œ˜RQ³~‚9€ƒ€ƒ‚ƒ€€ƒ‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( -- )äª$C¥D: B€U€Œ˜RQ‚9€€€€€‚ÿAppend the execution semantics of the current definition to the current definition. An ambiguous condition exists if RECURSE appears in a definition after DOES>.†5ÁC+EQ r€j€^Œ˜RQ³~‚9€ƒƒ€ãwß ü€‰€€ã°CMw€‰€€‚ÿSee:6.1.1250 DOES>, 6.1.2120 RECURSE.+¥DVE( €€R‚9€‚ÿ7+EE1ÓÿÿÿÿÿÿÿÿmE»E]IREPEAT. VE»E% €€˜˜€‚ÿREPEATMEF/ .€<€‘€‚H€€€ƒƒ‚ÿ6.1.2140 REPEAT COREºr»EÂFH `€ä€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: orig dest -- )ÖFÓG; D€­€Œ˜RQ‚9€€€€€‚ÿAppend the run-time semantics given below to the current definition, resolving the backward reference dest. Resolve the forward reference orig using the location following the appended run-time semantics.HÂFH3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )h6ÓGƒH2 4€l€Œ˜RQ‚9€€€‚ÿContinue execution at the location given by dest.„3HIQ r€f€^Œ˜RQ³~‚9€ƒ€ƒ€ãÿ‡ë€‰€€ãT£€‰€‚ÿSee:6.1.0760 BEGIN, 6.1.2430 WHILE.+ƒH2I( €€R‚9€‚ÿ+I]I( €€R‚9€‚ÿ42I‘I1Àÿÿÿÿÿÿÿÿn‘IŒIKKROT+]IŒI% € €˜˜€‚ÿROT`%‘IJ; F€J€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2160 ROT «rote»CORE-ŒI©J` €Z€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€‚ÿ( x1 x2 x3 -- x2 x3 x1 )P&JùJ* $€L€Œ˜RQ‚H€‚ÿRotate the top three stack entries.)©J"K& €€R‚H€‚ÿ)ùJKK& €€R‚H€‚ÿ7"K‚K1’ÿÿÿÿÿÿÿÿo‚K°KNRSHIFT. KK°K% €€˜˜€‚ÿRSHIFTf+‚KL; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2162 RSHIFT «r-shift»CORE[°KqLB T€2€Œ˜RQ‚H€€€€€€€€€‚ÿ( x1 u -- x2 )8íL©MK d€Û€Œ˜RQ‚H€€€€€€€€€€€‚ÿPerform a logical right shift of u bit-places on x1, giving x2. Put zeroes into the most significant bits vacated by the shift. An ambiguous condition exists if u is greater than or equal to the number of bits in a cell.h&qLNB T€L€R‚H€‚€ƒ€ƒ€ãO=ºB€‰€€‚‚ÿSee:6.1.1805 LSHIFT 3©MDN1ÿÿÿÿÿÿÿÿpDNnNg‚S"*NnN% € €˜˜€‚ÿS"b'DNÐN; F€N€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2165 S" «s-quote»COREºrnNŠOH `€ä€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( «ccc» -- )¯vÐNE€9 B€ì€Œ˜RQ‚9€€€€€‚ÿParse ccc delimited by " (double-quote). Append the runŠOE€N-time semantics given below to the current definition.a"ŠOŠ€? N€D€^Œ˜RQ³~‚9€ƒ€ƒ€€€€‚ÿRun-time:( -- c-addr u )ÃE€i@ N€€Œ˜RQ‚9€€€€€€€‚ÿReturn c-addr and u describing a string consisting of the characters ccc. A program shall not alter the returned string.šEŠ€‚c –€Š€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所€ã8²Ý󀉀€ãio€€‰€€‚ÿSee:3.4.1 Parsing, 6.2.0855 C", 11.6.1.2165 S".+i<‚( €€R‚9€‚ÿ+‚g‚( €€R‚9€‚ÿ4<‚›‚1‘ÿÿÿÿÿÿÿÿq›‚Ƃ&„S>D+g‚Ƃ% € €˜˜€‚ÿS>Db'›‚(ƒ; F€N€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2170 S>D «s-to-d»COREGƂoƒ6 <€"€Œ˜RQ‚H€€€€€‚ÿ( n -- d )ŽX(ƒýƒ6 <€°€Œ˜RQ‚H€€€€€‚ÿConvert the number n to the double-cell number d with the same numerical value. )oƒ&„& €€R‚H€‚ÿ5ýƒ[„1öÿÿÿÿÿÿÿÿr[„‡„L†SIGN,&„‡„% €€˜˜€‚ÿSIGNK[„҄/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.2210 SIGN CORE= ‡„…0 0€€Œ˜RQ‚H€€€‚ÿ( n -- )É҄#†K d€“€Œ˜RQ‚H€€€€€ã2¬J¿€‰ãX­J¿‰€‚ÿIf n is negative, add a minus sign to the beginning of the pictured numeric output string. An ambiguous condition exists if SIGN executes outside of a <# #> delimited number conversion.)…L†& €€R‚H€‚ÿ7#†ƒ†1Oÿÿÿÿÿÿÿÿsƒ†±†ωSM/REM. L†±†% €€˜˜€‚ÿSM/REMl1ƒ†‡; F€b€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2214 SM/REM «s-m-slash-rem»COREo!±†Œ‡N l€B€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿ( d1 n1 -- n2 n3 )\‡èˆZ ‚€€Œ˜RQ‚H€€€€€€€€€€€€€€€€‚ÿDivide d1 by n1, giving the symmetric quotient n3 and the remainder n2. Input and output stack arguments are signed. An ambiguous condition exists if n1 is zero or if the quotient lies outside the range of a single-cell signed integer. ŒVŒ‡€‰f œ€¬€^Œ˜RQ³~‚9€ƒ€€ƒ€ã1Ë&㉀€€ãùái€‰€€€ãîqٔ€‰€‚ÿSee:3.2.2.1 Integer division, 6.1.1561 FM/MOD, 6.1.2370 UM/MOD.+èˆω( €€R‚9€‚ÿ7€‰Š1}ÿÿÿÿÿÿÿÿtŠ4Š€‹SOURCE. ω4Š% €€˜˜€‚ÿSOURCEMŠŠ/ .€<€‘€‚H€€€ƒƒ‚ÿ6.1.2216 SOURCE COREL4Š͊6 <€,€Œ˜RQ‚H€€€€€‚ÿ( -- c-addr u )ŠWŠW‹3 6€®€Œ˜RQ‚H€€€€‚ÿc-addr is the address of, and u is the number of characters in, the input buffer.)͊€‹& €€R‚H€‚ÿ6W‹¶‹1ÿÿÿÿÿÿÿÿu¶‹ã‹ʌSPACE-€‹ã‹% €€˜˜€‚ÿSPACEL¶‹/Œ/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.2220 SPACE CORE3 ã‹bŒ* $€€Œ˜RQ‚H€‚ÿ( -- )?/Œ¡Œ* $€*€Œ˜RQ‚H€‚ÿDisplay one space.)bŒʌ& €€R‚H€‚ÿ7¡Œ1Mÿÿÿÿÿÿÿÿv/KŽSPACES. ʌ/% €€˜˜€‚ÿSPACESM|/ .€<€‘€‚H€€€ƒƒ‚ÿ6.1.2230 SPACES CORE= /¹0 0€€Œ˜RQ‚H€€€‚ÿ( n -- )i3|"Ž6 <€f€Œ˜RQ‚H€€€€€‚ÿIf n is greater than zero, display n spaces.)¹KŽ& €€R‚H€‚ÿ6"ŽŽ1ÊÿÿÿÿÿÿÿÿwŽ®ŽSÃSTATE-KŽ®Ž% €€˜˜€‚ÿSTATELŽúŽ/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.2250 STATE COREB®Ž<0 0€$€Œ˜RQ‚H€€€‚ÿ( -- a-addr ) ‰úŽQÁ€ ΀€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿa-addr is the address of a cell containing the compilation-state f<QÁKŽlag. STATE is true when in compilation state, false otherwise. The true value in STATE is non-zero, but is otherwise implementation-defined. Only the following standard words alter the value in STATE: : (colon), ; (semicolon), ABORT, QUIT, :NONAME, [ (left-bracket), and ] (right-bracket).×<(ÃÈ ^€^Œ˜RQ³~‚9€ƒ€€ƒ€€‚€ƒ€ƒ€ã€á牀€ã¬J¿€‰€€€ã¬J¿€‰€€ãB\W €€ãòŠn€‰€€ã,¬J¿€‰€€ã.¬J¿€‰€€ãÔ@T€‰€€€€‚ÿNote:A program shall not directly alter the contents of STATE.See:3.4 The Forth text interpreter, 6.1.0450 :, 6.1.0460 ;, 6.1.0670 ABORT, 6.1.2050 QUIT, 6.1.2500 [, 6.1.2540 ], 6.2.0455 :NONAME, 15.6.2.2250 STATE.+QÁSÃ( €€R‚9€‚ÿ5(ÈÃ1bÿÿÿÿÿÿÿÿxˆÃŽÃåÄSWAP,SÃŽÃ% €€˜˜€‚ÿSWAPKˆÃÿÃ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.2260 SWAP COREo!ŽÃnÄN l€B€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿ( x1 x2 -- x2 x1 )N$ÿÃŒÄ* $€H€Œ˜RQ‚H€‚ÿExchange the top two stack items.)nÄåÄ& €€R‚H€‚ÿ5ŒÄÅ15ÿÿÿÿÿÿÿÿyÅFÅJÈTHEN,åÄFÅ% €€˜˜€‚ÿTHENKÅ‘Å/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.2270 THEN CORE­kFÅ>ÆB T€Ö€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: orig -- )Ø¥‘ÅÇ3 4€K€˜RS‚9€€€‚ÿAppend the run-time semantics given below to the current definition. Resolve the forward reference orig using the location of the appended run-time semantics.H>Æ^Ç3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )AÇŸÇ+ &€,€˜RS‚9€‚ÿContinue execution.€/^ÇÈQ r€^€^Œ˜RQ³~‚9€ƒ€ƒ€ã. d€‰€€ãºp(€‰€‚ÿSee:6.1.1310 ELSE, 6.1.1700 IF.+ŸÇJÈ( €€R‚9€‚ÿ5ÈÈ1ŒÿÿÿÿÿÿÿÿzÈ«È6ÌTYPE,JÈ«È% €€˜˜€‚ÿTYPEKÈöÈ/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.2310 TYPE COREK«ÈAÉ5 :€,€˜RS‚H€€€€€‚ÿ( c-addr u -- )–[öÈ×É; F€¶€˜RS‚H€€€€€€€‚ÿIf u is greater than zero, display the character string specified by c-addr and u.Ñ—AÉšË: B€/€˜RS‚H€€ãȫ㉀‚ÿWhen passed a character in a character string whose character-defining bits have a value between hex 20 and 7E inclusive, the corresponding standard character, specified by 3.1.2.1 graphic characters, is displayed. Because different output devices can respond differently to control characters, programs that use control characters to perform specific functions have an environmental dependency.c×É ÌE Z€<€^Œ˜RQ³~‚9€ƒ€ƒ€€ã/ d€‰€‚ÿSee:6.1.1320 EMIT.+šË6Ì( €€R‚9€‚ÿ3 ÌiÌ1Iÿÿÿÿÿÿÿÿ{iÌ“Ì«ÍU.*6Ì“Ì% € €˜˜€‚ÿU.`%iÌóÌ; F€J€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2320 U. «u-dot»CORE< “Ì/Í/ .€€˜RS‚H€€€‚ÿ( u -- )S$óÌ‚Í/ .€H€˜RS‚H€€€‚ÿDisplay u in free field format.)/Í«Í& €€R‚H€‚ÿ3‚ÍÞÍ1îÿÿÿÿÿÿÿÿ|ÞÍÎÅÏU<*«ÍÎ% € €˜˜€‚ÿU<f+ÞÍnÎ; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2340 U< «u-less-than»CORE]ÎËÎA R€8€˜RS‚H€€€€€€€€€‚ÿ( u1 u2 -- flag )w9nÎBÏ> L€r€˜RS‚H€€€€€€€€‚ÿflag is true if and only if u1 is less than u2.XËΚÏ? N€2€^Œ˜RQ³~‚9€ƒƒ€ã¬J¿€‰€‚ÿSee:6.1.0480 <.+BÏÅÏ( €€R‚9€‚ÿ4šÏ 1Ïÿÿÿÿÿÿÿÿ} 7ÔUM*ÅÏ ÅÏ+ÅÏ7% € €˜˜€‚ÿUM*d) ›; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2360 UM* «u-m-star»CORE[7öA R€4€˜RS‚H€€€€€€€€€‚ÿ( u1 u2 -- ud )µs›«B T€æ€˜RS‚H€€€€€€€€€‚ÿMultiply u1 by u2, giving the unsigned double-cell product ud. All values and arithmetic are unsigned.)öÔ& €€R‚H€‚ÿ7« 10ÿÿÿÿÿÿÿÿ~ 98UM/MOD. Ô9% €€˜˜€‚ÿUM/MODl1 ¥; F€b€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2370 UM/MOD «u-m-slash-mod»COREk 9K f€@€Œ˜RQ‚H€€€€€€€€€€€€‚ÿ( ud u1 -- u2 u3 )Ió¥YV z€ç€˜RS‚H€€€€€€€€€€€€€€€‚ÿDivide ud by u1, giving the quotient u3 and the remainder u2. All values and arithmetic are unsigned. An ambiguous condition exists if u1 is zero or if the quotient lies outside the range of a single-cell unsigned integer.ŽT ` €š€^Œ˜RQ³~‚9€ƒ€€ƒ€ã1Ë&㉀€ãùái€‰€€ãíïW„€‰€‚ÿSee:3.2.2.1 Integer division, 6.1.1561 FM/MOD, 6.1.2214 SM/REM.+Y8( €€R‚9€‚ÿ7 o1òÿÿÿÿÿÿÿÿo^UNLOOP. 8% €€˜˜€‚ÿUNLOOPNoë/ .€>€‘€‚H€€€ƒƒ‚ÿ6.1.2380 UNLOOP CORE¶t¡B T€è€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- ) ( R: loop-sys -- )0ïëÑA P€ß€Œ˜RQ‚9€€€€ãœß”‚ÿDiscard the loop-control parameters for the current nesting level. An UNLOOP is required for each nesting level before the definition may be EXITed. An ambiguous condition exists if the loop-control parameters are unavailable.b#¡3? N€F€^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所‚ÿSee:3.2.3.3 Return stack.+Ñ^( €€R‚9€‚ÿ63”1:ÿÿÿÿÿÿÿÿ€”ÁÊ UNTIL-^Á% €€˜˜€‚ÿUNTILL” / .€:€‘€‚H€€€ƒƒ‚ÿ6.1.2390 UNTIL CORE­kÁº B T€Ö€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: dest -- )€q ^ 3 6€â€Œ˜RQ‚9€€€‚ÿAppend the run-time semantics given below to the current definition, resolving the backward reference dest.Rº ° 9 B€2€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( x -- )W^ ? 8 @€®€Œ˜RQ‚9€€€€€‚ÿIf all bits of x are zero, continue execution at the location specified by dest.`° Ÿ B T€<€^Œ˜RQ³~‚9€ƒ€ƒ€ãÿ‡ë€‰€‚ÿSee:6.1.0760 BEGIN.+? Ê ( €€R‚9€‚ÿ9Ÿ  1×ÿÿÿÿÿÿÿÿ 3  @VARIABLE0 Ê 3 % €€˜˜€‚ÿVARIABLEO  ‚ / .€@€‘€‚H€€€ƒƒ‚ÿ6.1.2410 VARIABLE CORER3 Ô 6 <€8€Œ˜RQ‚H€€€€€‚ÿ( «name» -- )ʂ × 9 @€•€Œ˜RQ‚H€€€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Create a definition for name with the execution semantics defined below. Reserve one cell of data space at an aligned address.e,Ô <9 B€X€Œ˜RQ‚H€€€€€€‚ÿname is referred to as a «variable».e&× ¡? N€L€^Œ˜RQ³~‚9€ƒ€€€ƒ€€‚ÿname Execution:( -- a-addr )®~<O0 0€ü€Œ˜RQ‚9€€‚ÿa-addr is the address of the reserved cell. A program is responsible for initializing the contents of the reserved cell._¡®B T€:€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所‚ÿSee:3.4.1 Parsing.+O @( €€R‚9€‚ÿ® @Ê 6®B@1Óÿÿÿÿÿÿÿÿ‚B@o@DWHILE- @o@% €€˜˜€‚ÿWHILELB@»@/ .€:€‘€‚H€€€ƒƒ‚ÿ6.1.2430 WHILE COREÇyo@‚AN l€ò€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: dest -- orig dest )o»@ñBT v€7€Œ˜RQ‚9€€€€€€€€€ã±CMw€‰€‚ÿPut the location of a new unresolved forward reference orig onto the control flow stack, under the existing dest. Append the run-time semantics given below to the current definition. The semantics are incomplete until orig and dest are resolved (e.g., by REPEAT).R‚ACC9 B€2€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( x -- )£jñBæC9 B€Ô€Œ˜RQ‚9€€€€€‚ÿIf all bits of x are zero, continue execution at the location specified by the resolution of orig.+CCD( €€R‚9€‚ÿ5æCFD1ÿÿÿÿÿÿÿÿƒFDrD]IWORD,DrD% €€˜˜€‚ÿWORDKFDœD/ .€8€‘€‚H€€€ƒƒ‚ÿ6.1.2450 WORD COREr0rD/EB T€`€Œ˜RQ‚H€€€€€€€€€‚ÿ( char «ccc» -- c-addr ) ÓœD;F9 @€§€Œ˜RQ‚H€€€€€‚ÿSkip leading delimiters. Parse characters ccc delimited by char. An ambiguous condition exists if the length of the parsed string is greater than the implementation-defined length of a counted string.|K/E·G1 0€—€Œ˜RQ‚H€€‚ÿc-addr is the address of a transient region containing the parsed word as a counted string. If the parse area was empty or contained no characters other than the delimiter, the resulting string has a zero length. A space, not included in the length, follows the string. A program may replace characters within the string.z;F1If š€)€^Œ˜RQ³~‚9€ƒ€€ƒã;²Ý󀉀‚€ƒ€ƒ€ãæûÝ㉀€ãK5所‚ÿNote:The requirement to follow the string with a space is obsolescent and is included as a concession to existing programs that use CONVERT. A program shall not depend on the existence of the space.See:3.3.3.6 Other transient regions, 3.4.1 Parsing.,·G]I) "€€ ˜R‚9€‚ÿ41I‘I1˜ÿÿÿÿÿÿÿÿ„‘IŒI#KXOR+]IŒI% € €˜˜€‚ÿXOR`%‘IJ; F€J€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2490 XOR «x-or»CORE`ŒI|JE Z€6€Œ˜RQ‚H€€€€€€€€€€‚ÿ( x1 x2 -- x3 )};JùJB T€v€Œ˜RQ‚H€€€€€€€€€‚ÿx3 is the bit-by-bit exclusive-or of x1 with x2.*|J#K' €€ ˜R‚H€‚ÿ2ùJUK1¿ÿÿÿÿÿÿÿÿ…UK~K N[)#K~K% €€˜˜€‚ÿ[f+UKäK; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2500 [ «left-bracket»COREâœ~KÆLF Z€9€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ‚€ƒ€ƒ‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:Perform the execution semantics given below.Execution:( -- )k9äK1M2 4€r€Œ˜RQ‚9€€€‚ÿEnter interpretation state. [ is an immediate word.¯UÆLàMZ „€ª€^Œ˜RQ³~‚9€ƒ€ƒ€ã€á牀€㓠ã‰€€ã.¬J¿€‰€‚ÿSee:3.4 The Forth text interpreter, 3.4.5 Compilation, 6.1.2540 ].,1M N) "€€ ˜R‚9€‚ÿ4àM@N1ãÿÿÿÿÿÿÿÿ†@NkN$ƒ[']+ NkN% € €˜˜€‚ÿ[']h-@NÓN; F€Z€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2510 ['] «bracket-tick»COREŒtkNOH `€è€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( «name» -- )ԚÓNo€: B€5€Œ˜RQ‚9€€€€€‚ÿSkip leading space delimiters. Parse name delimitedOo€ N by a space. Find name. Append the run-time semantics given below to the current definition.j8Oـ2 4€p€Œ˜RQ‚9€€€‚ÿAn ambiguous condition exists if name is not found.So€,9 B€4€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( -- xt )ÂـJ‚\ †€…€Œ˜RQ‚9€€€€€€€€€€€€€€€€‚ÿPlace name’s execution token xt on the stack. The execution token returned by the compiled phrase «['] X » is the same value returned by «' X » outside of compilation state.¯X,ù‚W ~€°€^Œ˜RQ³~‚9€ƒ€ƒ€ãK5所€€€€€€€€‚ÿSee:3.4.1 Parsing, A.6.1.0070 ', A.6.1.2033 POSTPONE, D.6.7 Immediacy.+J‚$ƒ( €€R‚9€‚ÿ7ù‚[ƒ1 ÿÿÿÿÿÿÿÿ‡[ƒ‰ƒø†[CHAR]. $ƒ‰ƒ% €€˜˜€‚ÿ[CHAR]k0[ƒôƒ; F€`€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2520 [CHAR] «bracket-char»COREŒt‰ƒ°„H `€è€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( «name» -- )ÀŒôƒp…4 6€€Œ˜RQ‚9€€€‚ÿSkip leading space delimiters. Parse name delimited by a space. Append the run-time semantics given below to the current definition.U°„Ņ9 B€8€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( -- char )‚Jp…G†8 @€”€Œ˜RQ‚9€€€€€‚ÿPlace char, the value of the first character of name, on the stack.†2Ņ͆T x€d€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所€㜳Ý󀉀€‚ÿSee:3.4.1 Parsing, 6.1.0895 CHAR.+G†ø†( €€R‚9€‚ÿ2͆*‡1Ãÿÿÿÿÿÿÿÿˆ*‡S‡åˆ])ø†S‡% €€˜˜€‚ÿ]g,*‡º‡; F€X€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.1.2540 ] «right-bracket»CORE3 S‡í‡* $€€Œ˜RQ‚H€‚ÿ( -- )Eº‡2ˆ* $€6€Œ˜RQ‚H€‚ÿEnter compilation state.³Ví‡åˆ] Š€¬€^Œ˜RQ³~‚9€ƒ€ƒ€ã€á牀€㓠ã‰€€€ã,¬J¿€‰€‚ÿSee:3.4 The Forth text interpreter, 3.4.5 Compilation, 6.1.2500 [.12ˆ‰1Çÿÿÿÿÿÿÿÿ‰ÿÿÿÿ‰¬‰'åˆ=‰$ €€R€‚ÿH ‰…‰( €@€°˜€ € ‚ÿ6.2 Core extension words '=‰¬‰$ €€R€‚ÿ5…‰á‰15ÿÿÿÿÿÿÿÿŠá‰ ŠŒ#TIB,¬‰ Š% €€˜˜€‚ÿ#TIBm2á‰zŠ; F€d€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0060 #TIB «number-t-i-b»CORE EXTB ŠŒŠ0 0€$€Œ˜RQ‚H€€€‚ÿ( -- a-addr )“fzŠO‹- *€Ì€˜RS‚H€€‚ÿa-addr is the address of a cell containing the number of characters in the terminal input buffer.—aŒŠæ‹6 <€Â€^Œ˜RQ³~‚9€ƒƒ€€‚ÿNote:This word is obsolescent and is included as a concession to existing implementations.+O‹Œ( €€R‚9€‚ÿ3æ‹DŒ1ÿÿÿÿÿÿÿÿ‹DŒnŒʎ.(*ŒnŒ% € €˜˜€‚ÿ.(h-DŒ֌; F€Z€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0200 .( «dot-paren»CORE EXT¬dnŒ‚H `€È€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿCompilation:Perform the execution semantics given below.Execution:( «ccc» -- )™\֌Ž= J€ž€˜RS‚9€€€€€€€‚ÿParse and display ccc delimited by ) (right parenthesis). .( is an immediate word.„0‚ŸŽT x€`€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所€ãÕ«J¿€‰€€‚ÿSee:3.4.1 Parsing, 6.1.0190 .".+Žʎ( €€R‚9€‚ÿ3ŸŽýŽ1ïÿÿÿÿÿÿÿÿŒýŽ'BÁ.R*ʎ'% € €˜˜€‚ÿ.Rd)ýŽ‹; F€R€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0210 .R «dot-r»CORE EXTQ'܏< H€*€Œ˜RQ‚H€€€€€€€‚ÿ( n1 n2 -- )1ዏÁP n€Ã€˜RS‚܏ÁʎH€€€€€€€€€€€€€‚ÿDisplay n1 right aligned in a field n2 characters wide. If the number of characters required to display n1 is greater than n2, all digits are displayed with no leading spaces in a field as wide as necessary.)܏BÁ& €€R‚H€‚ÿ4ÁvÁ1~ÿÿÿÿÿÿÿÿvÁ¡ÁîÂ0<>+BÁ¡Á% € €˜˜€‚ÿ0<>o4vÁÂ; F€h€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0260 0<> «zero-not-equals»CORE EXTJ¡ÁZÂ6 <€(€Œ˜RQ‚H€€€€€‚ÿ( x -- flag )k9ÂÅÂ2 4€r€˜RS‚H€€€€‚ÿflag is true if and only if x is not equal to zero.)ZÂîÂ& €€R‚H€‚ÿ3ÅÂ!Ã1yÿÿÿÿÿÿÿÿŽ!ÃKÓÄ0>*îÂKÃ% € €˜˜€‚ÿ0>k0!öÃ; F€`€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0280 0> «zero-greater»CORE EXTIKÃÿÃ5 :€(€˜RS‚H€€€€€‚ÿ( n -- flag )k9¶ÃjÄ2 4€r€˜RS‚H€€€€‚ÿflag is true if and only if n is greater than zero.)ÿÓÄ& €€R‚H€‚ÿ4jÄÇÄ1VÿÿÿÿÿÿÿÿÇÄòÄÈ2>R+“ÄòÄ% € €˜˜€‚ÿ2>Rh-ÇÄZÅ; F€Z€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0340 2>R «two-to-r»CORE EXTã‚òÄ=Æa €€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( x1 x2 -- ) ( R: -- x1 x2 )£`ZÅàÆC V€À€˜RS‚9€€€€€€€€€‚ÿTransfer cell pair x1 x2 to the return stack. Semantically equivalent to SWAP >R >R. €=ÆìÇŒ 怀^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã­CMw€‰€€ã®CMw€‰€€ã¯CMw€‰€€ãT¬J¿€‰€€ãU¬J¿€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.0580 >R, 6.1.2060 R>, 6.1.2070 R@, 6.2.0410 2R>, 6.2.0415 2R@.+àÆÈ( €€R‚9€‚ÿ4ìÇKÈ1]ÿÿÿÿÿÿÿÿKÈvÈ¢Ë2R>+ÈvÈ% € €˜˜€‚ÿ2R>j/KÈàÈ; F€^€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0410 2R> «two-r-from»CORE EXTäƒvÈÄÉa €€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- x1 x2 ) ( R: x1 x2 -- )§càÈkÊD X€Æ€˜RS‚9€€€€€€€€€‚ÿTransfer cell pair x1 x2 from the return stack. Semantically equivalent to R> R> SWAP. €ÄÉwËŒ 怀^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã­CMw€‰€€ã®CMw€‰€€ã¯CMw€‰€€ãÛ-’À‰€€ãU¬J¿€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.0580 >R, 6.1.2060 R>, 6.1.2070 R@, 6.2.0340 2>R, 6.2.0415 2R@.+kÊ¢Ë( €€R‚9€‚ÿ4wËÖË1ƒÿÿÿÿÿÿÿÿ‘ÖËÌSÏ2R@+¢ËÌ% € €˜˜€‚ÿ2R@k0ÖËlÌ; F€`€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0415 2R@ «two-r-fetch»CORE EXTÌnÍs Ž€€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€€€€€€€€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( -- x1 x2 ) ( R: x1 x2 -- x1 x2 )®jlÌÎD X€Ô€˜RS‚9€€€€€€€€€‚ÿCopy cell pair x1 x2 from the return stack. Semantically equivalent to R> R> 2DUP >R >R SWAP. €nÍ(ÏŒ 怀^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ã­CMw€‰€€ã®CMw€‰€€ã¯CMw€‰€€ãÛ-’À‰€€ãT¬J¿€‰€‚ÿSee:3.2.3.3 Return stack, 6.1.0580 >R, 6.1.2060 R>, 6.1.2070 R@, 6.2.0340 2>R, 6.2.0410 2R>.+ÎSÏ( €€R‚9€‚ÿ8(Ï‹Ï1~ÿÿÿÿÿÿÿÿ’‹ÏºÏ :NONAME/ SϺÏ% €€˜˜€‚ÿ:NONAMEq6‹Ï7; F€l€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0455 ºÏ7SÏ :NONAME «colon-no-name»CORE EXT`*ºÏ—6 <€T€Œ˜RQ‚H€€€€€‚ÿ( C: -- colon-sys ) ( S: -- xt )õœ7Œ8 >€{€˜RS‚H€€€€€‚ÿCreate an execution token xt, enter compilation state and start the current definition, producing colon-sys. Append the initiation semantics given below to the current definition.ꭗv= H€[€˜RS‚H€€€€€€€‚ÿThe execution semantics of xt will be determined by the words compiled into the body of the definition. This definition can be executed later by using xt EXECUTE.Ý ŒS= H€A€˜RS‚H€€€€ã£ËÑ所‚ÿIf the control-flow stack is implemented using the data stack, colon-sys shall be the topmost item on the data stack. See 3.2.3.2 Control-flow stack.ƒ;vÖH `€v€^Œ˜RQ³~‚9€ƒ€€ƒ€€€€€€‚ÿInitiation:( i*x -- i*x ) ( R: -- nest-sys )ˌS¡? L€€˜RS‚9€€€€€€€‚ÿSave implementation-dependent information nest-sys about the calling definition. The stack effects i*x represent arguments to xt.l'Ö E Z€N€^Œ˜RQ³~‚9€ƒ€€€ƒ€€€€‚ÿxt Execution:( i*x -- j*x )ь¡ÞE X€€˜RS‚9€€€€€€€€€‚ÿExecute the definition specified by xt. The stack effects i*x and j*x represent arguments to and results from xt, respectively.+  ( €€R‚9€‚ÿ3Þ<1ýÿÿÿÿÿÿÿÿ“<f2<>* f% € €˜˜€‚ÿ<>i.<Ï; F€\€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0500 <> «not-equals»CORE EXT^f-B T€8€Œ˜RQ‚H€€€€€€€€€‚ÿ( x1 x2 -- flag )ŠKÏ·? N€–€Œ˜RQ‚H€€€€€€€€‚ÿflag is true if and only if x1 is not bit-for-bit the same as x2.)-à& €€R‚H€‚ÿ)· & €€R‚H€‚ÿ)à2& €€R‚H€‚ÿ4 f1&ÿÿÿÿÿÿÿÿ”f‘†?DO+2‘% € €˜˜€‚ÿ?DOk0fü; F€`€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0620 ?DO «question-do»CORE EXT¯m‘« B T€Ú€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: -- do-sys ) Ëü· A P€—€Œ˜RQ‚9€€€€€€€‚ÿPut do-sys onto the control-flow stack. Append the run-time semantics given below to the current definition. The semantics are incomplete until resolved by a consumer of do-sys such as LOOP.¢E« Y ] Š€Š€^Œ˜RQ³~‚9€ƒ€ƒ€€€€€€€€€€€€€€‚ÿRun-time:( n1|u1 n2|u2 -- ) ( R: -- | loop-sys )pÇ· É © €Œ˜RQ‚9€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€€‚ÿIf n1|u1 is equal to n2|u2, continue execution at the location given by the consumer of do-sys. Otherwise set up loop control parameters with index n2|u2 and limit n1|u1 and continue executing immediately following ?DO. Anything already on the return stack becomes unavailable until the loop control parameters are discarded. An ambiguous condition exists if n1|u1 and n2|u2 are not both of the same type.<¡Y › C€^Œ˜RQ³~‚9€ƒ€ƒ€ã£ËÑ所€ãK=ºB€‰€€ãvß ü€‰€€ãºp(€‰€€ãL=ºB€‰€€ãN=ºB€‰€€ãáƖ‘€‰€‚ÿSee:3.2.3.2 Control-flow stack, 6.1.0140 +LOOP, 6.1.1240 DO, 6.1.1680 I, 6.1.1760 LEAVE, 6.1.1800 LOOP, 6.1.2380 UNLOOP.+É 0( €€R‚9€‚ÿ+[( €€R‚9€‚ÿ+0†( €€R‚9€‚ÿ6[Œ1ˆÿÿÿÿÿÿÿÿ•Œ @YCAGAIN-† @% €€˜˜€‚ÿAGAINŒ @†Q"Œ]@/ .€D€‘€‚H€€€ƒƒ‚ÿ6.2.0700 AGAIN CORE EXT­k @ AB T€Ö€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: dest -- )€q]@®A3 6€â€Œ˜RQ‚9€€€‚ÿAppend the run-time semantics given below to the current definition, resolving the backward reference dest.H AöA3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )Ԛ®AÊB: B€5€Œ˜RQ‚9€€€€€‚ÿContinue execution at the location specified by dest. If no other control flow words are used, any program code after AGAIN will not be executed.döA.CE Z€>€^Œ˜RQ³~‚9€ƒ€ƒ€€ãÿ‡ë€‰€‚ÿSee:6.1.0760 BEGIN.+ÊBYC( €€R‚9€‚ÿ3.CŒC1Ñÿÿÿÿÿÿÿÿ–ŒC¶CVGC"*YC¶C% € €˜˜€‚ÿC"f+ŒCD; F€V€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0855 C" «c-quote»CORE EXTºr¶CÖDH `€ä€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( «ccc» -- )°xD†E8 @€ð€˜RS‚9€€€€€‚ÿParse ccc delimited by " (double-quote) and append the run-time semantics given below to the current definition.WÖDÝE9 B€<€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( -- c-addr )±y†EŽF8 @€ò€˜RS‚9€€€€€‚ÿReturn c-addr, a counted string consisting of the characters ccc. A program shall not alter the returned string.CÝE+GZ „€†€^Œ˜RQ³~‚9€ƒ€€ƒ€ãK5所€ãio€€‰€€€€‚ÿSee:3.4.1 Parsing, 6.1.2165 S", 11.6.1.2165 S". +ŽFVG( €€R‚9€‚ÿ5+G‹G1Qÿÿÿÿÿÿÿÿ—‹G·G×JCASE,VG·G% €€˜˜€‚ÿCASEO ‹GH/ .€@€‘€‚H€€€ƒƒ‚ÿ6.2.0873 CASE CORE EXT±o·G·HB T€Þ€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: -- case-sys )ÏHzI4 6€€Œ˜RQ‚9€€€‚ÿMark the start of the CASE ... OF ... ENDOF ... ENDCASE structure. Append the run-time semantics given below to the current definition.H·HÂI3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )BzIJ, (€,€Œ˜RQ‚9€‚ÿContinue execution.§GÂI«J` €Ž€^Œ˜RQ³~‚9€ƒ€ƒ€ã3 d€‰€€ã4 d€‰€€ã~À]€‰€‚ÿSee:6.2.1342 ENDCASE, 6.2.1343 ENDOF, 6.2.1950 OF.,J×J) "€€ ˜R‚9€‚ÿ9«JK1)ÿÿÿÿÿÿÿÿ˜K@K8MCOMPILE,0 ×J@K% €€˜˜€‚ÿCOMPILE,r7K²K; F€n€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.0945 COMPILE, «compile-comma»CORE EXTŠd@KXLB T€È€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒƒ€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Execution:( xt -- )Ž€²K M4 6€€Œ˜RQ‚9€€€‚ÿAppend the execution semantics of the definition represented by xt to the execution semantics of the current definition. ,XL8M) "€€ ˜R‚9€‚ÿ8 MpM1µÿÿÿÿÿÿÿÿ™pMŸMäCONVERT/ 8MŸM% €€˜˜€‚ÿCONVERTR#pMñM/ .€F€‘€‚H€€€ƒƒ‚ÿ6.2.0970 CONVERT CORE EXT{-ŸMlNN l€Z€Œ˜RQ‚H€€€€€€€€€€€€€‚ÿ( ud1 c-addr1 -- ud2 c-addr2 )&žñMž€n ª€q€Œ˜RQ‚H€€€€€€€€€€€€€€€€€€€€€€‚ÿud2 is the result of converting the characters within the text beginning at the first character after c-addr1 into digits, using the number in BASE, and adding each digit to ud1 after multiplying ud1 by the number in BASE. Conversion continues until a character that is not lNž€8Mconvertible is encountered. c-addr2 is the location of the first unconverted character. An ambiguous condition exists if ud2 overflows.ŸlNž\ †€}€^Œ˜RQ³~‚9€ƒ€€ƒ€ãÁ”@T€‰€‚€ƒ€ƒ€ã.öÌ剀‚ÿNote:This word is obsolescent and is included as a concession to existing implementations. Its function is superseded by 6.1.0570 >NUMBER.See:3.2.1.2 Digit conversion.,ž€ä) "€€ ˜R‚9€‚ÿ8ž‚1Óÿÿÿÿÿÿÿÿš‚K‚í…ENDCASE/ äK‚% €€˜˜€‚ÿENDCASEl1‚·‚; F€b€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.1342 ENDCASE «end-case»CORE EXT±oK‚hƒB T€Þ€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: case-sys -- )ú¿·‚b„; D€€Œ˜RQ‚9€€€€€‚ÿMark the end of the CASE ... OF ... ENDOF ... ENDCASE structure. Use case-sys to resolve the entire structure. Append the run-time semantics given below to the current definition.RhƒŽ„9 B€2€^Œ˜RQ³~‚9€ƒ€ƒ€€‚ÿRun-time:( x -- )j8b„…2 4€p€Œ˜RQ‚9€€€‚ÿDiscard the case selector x and continue execution.€DŽ„…` €ˆ€^Œ˜RQ³~‚9€ƒ€ƒ€ã9²Ý󀉀€ã4 d€‰€€ã~À]€‰€‚ÿSee:6.2.0873 CASE, 6.2.1343 ENDOF, 6.2.1950 OF.+…í…( €€R‚9€‚ÿ6…#†1°ÿÿÿÿÿÿÿÿ›#†P†ϊENDOF-í…P†% €€˜˜€‚ÿENDOFh-#†ž†; F€Z€‘€‚H€€€ƒ€€€€ƒ‚ÿ6.2.1343 ENDOF «end-of»CORE EXT܇P†”‡U x€€^Œ˜RQ³~‚9€ƒ€ƒ‚€ƒ€ƒ€€€€€€€€‚ÿInterpretation:Interpretation semantics for this word are undefined.Compilation:( C: case-sys1 of-sys -- case-sys2 )Cž†1‰Z ‚€‡€Œ˜RQ‚9€€€€€€€€€€€€€€€‚ÿMark the end of the OF ... ENDOF part of the CASE structure. The next location for a transfer of control resolves the reference given by of-sys. Append the run-time semantics given below to the current definition. Replace case-sys1 with case-sys2 on the control-flow stack, to be resolved by ENDCASE.H”‡y‰3 6€*€^Œ˜RQ³~‚9€ƒ€ƒ‚ÿRun-time:( -- )…P1‰þ‰5 :€ €Œ˜RQ‚9€€€€‚ÿContinue execution at the location specified by the consumer of case-sys2.ŠFy‰€Š` €Œ€^Œ˜RQ³~‚9€ƒ€ƒ€ã9²Ý󀉀€ã3 d€‰€€ã~À]€‰€‚ÿSee:6.2.0873 CASE, 6.2.1342 ENDCASE, 6.2.1950 OF.+þ‰ϊ( €€R‚9€‚ÿ6€Š‹1©ÿÿÿÿÿÿÿÿœ‹2‹ªŒERASE-ϊ2‹% €€˜˜€‚ÿERASEP!‹‚‹/ .€B€‘€‚H€€€ƒƒ‚ÿ6.2.1350 ERASE CORE EXTJ2‹̋6 <€(€Œ˜RQ‚H€€€€€‚ÿ( addr u -- )µx‚‹Œ= J€ð€Œ˜RQ‚H€€€€€€€‚ÿIf u is greater than zero, clear all bits in each of u consecutive address units of memory beginning at addr .)̋ªŒ& €€R‚H€‚ÿ7ŒáŒ10ÿÿÿÿÿÿÿÿáŒôÁEXPECT. ªŒ% €€˜˜€‚ÿEXPECTQ"áŒ`/ .€D€‘€‚H€€€ƒƒ‚ÿ6.2.1390 EXPECT CORE EXTL¬5 :€.€˜RS‚H€€€€€‚ÿ( c-addr +n -- )™e`E4 6€Ë€˜RS‚H€€€‚ÿReceive a string of at most +n characters. Display graphic characters as they are received. A program that depends on the presence or absence of non-graphic characters in the string has an environmental dependency. The editing functions, if any, that the system performs in order to construct the string of characters are implementation-defined.(ö¬yÀ2 2€í€˜RS‚H€€€‚ÿInput terminates when an implementation-defined line terminator is received or when the string is +n characters long. When input terEyÀªŒminates, nothing is appended to the string and the display is maintained in an implementation-defined way.v;EïÀ; F€v€˜RS‚H€€€ãpo€€‰€‚ÿStore the string at c-addr and its length in SPAN.ږyÀÉÁD V€-€^Œ˜RQ³~‚9€ƒ€ƒ€ãE\W €‚ÿNote:This word is obsolescent and is included as a concession to existing implementations. Its function is superseded by 6.1.0695 ACCEPT.+ïÀôÁ( €€R‚9€‚ÿ6ÉÁ*Â1”ÿÿÿÿÿÿÿÿž*ÂWºÃFALSE-ôÁWÂ% €€˜˜€‚ÿFALSEP!*§Â/ .€B€‘€‚H€€€ƒƒ‚ÿ6.2.1485 FALSE CORE EXTAWÂèÂ0 0€"€Œ˜RQ‚H€€€‚ÿ( -- false )I§Â1Ã0 0€2€Œ˜RQ‚H€€€‚ÿReturn a false flag.^èÃB T€8€^Œ˜RQ³~‚9€ƒ€€ƒ€ãÙ所‚ÿSee:3.1.3.1 Flags+1úÃ( €€R‚9€‚ÿ4ÃîÃ1aÿÿÿÿÿÿÿÿŸîÃÄIÅHEX+ºÃÄ% € €˜˜€‚ÿHEXNîÃgÄ/ .€>€‘€‚H€€€ƒƒ‚ÿ6.2.1660 HEX CORE EXT3 ÄšÄ* $€€Œ˜RQ‚H€‚ÿ( -- )]'gÄ÷Ä6 <€N€Œ˜RQ‚H€ãþ‡ë€‰€‚ÿSet contents of BASE to sixteen.)šÄ Å& €€R‚H€‚ÿ)÷ÄIÅ& €€R‚H€‚ÿ7 Å€Å1˜ÿÿÿÿÿÿÿÿ €Å®ÅÊMARKER. IÅ®Å% €€˜˜€‚ÿMARKERU#€ÅÆ2 4€F€‘€‚H€€€ƒƒ€‚ÿ6.2.1850 MARKER CORE EXTQ