{"id":378,"date":"2018-03-20T15:42:34","date_gmt":"2018-03-20T14:42:34","guid":{"rendered":"https:\/\/www.hsu-hh.de\/hisalt\/?page_id=378"},"modified":"2018-03-20T15:42:34","modified_gmt":"2018-03-20T14:42:34","slug":"source-code-for-snobol4-and-spitbol386","status":"publish","type":"page","link":"https:\/\/www.hsu-hh.de\/hisalt\/source-code-for-snobol4-and-spitbol386","title":{"rendered":"Source Code (for SNOBOL4 and SPITBOL386)"},"content":{"rendered":"

*******************************************************************************
\n* *
\n* BETAUTF8.SNO *
\n* *
\n* SNOBOL4\/SPITBOL program to convert beta code texts to UTF8 *
\n* Prototypical implementation to check the algorithm *
\n* The program is heavily annotated to facilitate translation to JAVA or C *
\n* *
\n* (c) Burkhard Meissner, 2005-2013 *
\n* *
\n*******************************************************************************
\n*
\n* Set version information and compilation date\/time.
\n*
\n* Variable which holds the version information; later this variable
\n* will refer to the program parameters as sollicited from the command
\n* line:
\n*
\nparms = „Version 2.21 “ date()
\n*
\n*
\n*
\n*******************************************************************************
\n* *
\n* The program has been written specifically for the *
\n* *
\n* Papyrus Project Halle-Jena-Leipzig *
\n* under the direction of Professors Mehl, Scholl, Thiel *
\n* *
\n* and for Burkhard Meissner’s View & Find System for beta code texts (now *
\n* in the public domain). *
\n* *
\n* It has been successfully tested with a variety of beta code texts: *
\n* *
\n* Thesaurus Linguae Graecae (TLG) CD-ROM E *
\n* Packard Humanities Institute (PHI) CD-ROM 5.3 (Latin texts) *
\n* Packard Humanities Institute (PHI) CD-ROM 7 (Greek and Latin documentary *
\n* texts) *
\n* Miscellaneous beta code texts from the Oxford and Eichstaett (Prof.<\/abbr> Dr.<\/abbr> J. *
\n* Malitz) collections *
\n* Beta Code versions of texts from the Frankfurt inscription data base *
\n* (Prof.<\/abbr> Clauss) *
\n* *
\n*******************************************************************************
\n* *
\n* Nearly all signs which can be reproduced in unicode have been implemented. *
\n* All Greek and diacritic symbols are rendered correctly. *
\n* The program notes erroneous letter-accent-combinations which are present in *
\n* input text files (TLG; PHI 7; PHI53 and other text collections) and issues *
\n* appropriate error and warning messages. *
\n* *
\n* Yudit, Mined, GVim or OpenOffice are recommended as editors for the *
\n* resulting UTF8 (unicode) text files. *
\n* These files can equally well be read into some lower-quality text editors. *
\n* *
\n* To „normalize“ the text with precomposed and\/or decomposed accents, use the *
\n* uconv program of the unistring library or our compose\/decompose filters. *
\n* *
\n* To use the files with editors as strange as MS-Word(R), it may be useful to *
\n* translate them into UTF16 first. Under Linux, use the program recode: *
\n* recode UTF-8..UTF-16 file.utf *
\n* *
\n* BETAUTF8 is distributed under an open source license (GPL). *
\n* It may be copied and distributed freely, provided a copy of the GPL *
\n* (General Public License) is made available together with the program *
\n* itself, and provided a copy of this source code accompanies the program. *
\n* *
\n*******************************************************************************
\n* *
\n* *
\n* *
\n* The author kindly asks for suggestions of improvements and additions to be *
\n* sent to him at: *
\n* *
\n* Prof.<\/abbr> Dr.<\/abbr> Burkhard Meissner *
\n* Helmut Schmidt-Universitaet *
\n* University of the Federal Armed Forces *
\n* Chair of Ancient History *
\n* Holstenhofweg 85 *
\n* D-22043 Hamburg *
\n* Germany *
\n* Tel.: (49)-40-6541-3396 *
\n* Fax.: (49)-40-6541-2098 *
\n* e-mail: bmeissne@hsu-hamburg.de *
\n* *
\n*******************************************************************************
\n* *
\n* *
\n* Programming language: SNOBOL4\/MacroSPITBOL *
\n* *
\n* *
\n*******************************************************************************
\n*
\n* Set statement limit to unlimited, speed-up processing:
\n*
\n&STLIMIT = -1
\n*
\n* For older SNOBOL4 systems to be SPITBOL-compatible:
\n*
\n-PLUSOPS 1
\n*
\n*******************************************************************************
\n* *
\n* The program has been successfully tested under the following systems: *
\n* *
\n* Marc Emmer’s SPITBOL386 (Intel extended version) under DOS, MS Windows-32 *
\n* (Win-32 compatible extender), both real DOS and MS Windows systems *
\n* as well as emulated systems under control of the the Linux operating *
\n* system *
\n* Dave Shield’s Linux-SPITBOL 386 under Linux *
\n* Phil Budne’s CSNOBOL4: under DOS, Linux, Mac OS X (Darwin) with PPC *
\n* and MS Windows-32 *
\n* Marc Emmer’s Snobol4+ under MS-DOS and emulated DOS under Linux *
\n* *
\n* In principle, it should work with Mark Emmer’s MaxSPITBOL for the Apple *
\n* Macintosh Computer, too, but this system could not be tested. *
\n* *
\n*******************************************************************************
\n* *
\n* There are a few small 16-bit MacroSPITBOL compilers around: *
\n* *
\n* Mark Emmer’s SPITPC16 (16-bit integers) and SPITPC32 (32-bit integers) *
\n* as well as Robert B.K. Dewar’s older MacroSPITBOL.COM compiler (16 bit *
\n* integers). These three systems provide work spaces of 64 KBytes or less. *
\n* It is absolutely impossible to compile and\/or run betautf8 with these three *
\n* systems. *
\n* *
\n* Victors‘ Berstis‘ MinnesotaSNOBOL4.2 lacks some of the functionality *
\n* required to run betautf8.sno. Betautf8.sno should, however, principally be *
\n* be capable of being adapted to this system. However, the I\/O functions of *
\n* of MinnesotaSNOBOL4.2 seem less efficient, and we have not yet been able *
\n* to use betautf8 successfully together with MinnesotaSNOBOL4.2 *
\n* *
\n* *
\n*******************************************************************************
\n* *
\n* SPITBOL386 writes a stand-alone program module betautf8.exe; this version *
\n* is by far the fastest *
\n* Snobol4+ writes a save file betautf8.sav which runs faster, because it does *
\n* not have to go through the initialization section every time it is *
\n* used. Even though, this version is the slowest one. *
\n* LinuxSPITBOL writes a .spx run file which contains all the program’s rou- *
\n* tines in the form of indirectly-threaded code snippets. *
\n* CSNOBOL4 runs about 3-4 times slower than SPITBOL386, but twice as fast as *
\n* Snobol4+ *
\n* *
\n* CSNOBOL4 can be compiled natively for any operating system for which there *
\n* is a decent C compiler. *
\n* SPITBOL386 is a 32-bit application. *
\n* Snobol4+ is a 16-bit DOS program. *
\n* *
\n*******************************************************************************
\n* *
\n* Compilation\/Execution: *
\n* *
\n* SPITBOL -b -i2048k -s512k betautf8.sno *
\n* SNOBOL4+ \/NH betautf8.sno *
\n* CSnobol4 -b -d 2048k -P 32k -S 16k betautf8.sno *
\n* *
\n*******************************************************************************
\n* *
\n* Note on the algorithm: *
\n* *
\n* In order to facilitate the translation to other programming languages, *
\n* many of the powerful and flexible constructions of the SNOBOL4 language *
\n* are not used. Instead of, for example, approaching the problem with *
\n* complex string patterns (a strength of the language), we will use a *
\n* „byte-by-byte-eating“ approach, which is much slower and less elegant, but *
\n* can be re-programmed in any language at will. Furthermore, we do not use *
\n* function recursion. Our programmable beta-code converter *
\n* XLATE, which is part of the V&F system, uses pattern matching and recursive *
\n* functions heavily in order to provide a flexible, programmable translation *
\n* environment which can be made to translate any beta code into any coding *
\n* whatsoever. XLATE is intrinsically slower than BETAUTF8, though. *
\n* *
\n* We do, however, use the TABLE. A table is effectively a two-way associative *
\n* array, which is indexed by hash values and works as a kind of look-up *
\n* table. *
\n* *
\n* For example: *
\n* X = TABLE() creates such a table *
\n* X<„A“> = „B“ makes „A“ point to „B“ in the table *
\n* X<„X“> = „XYZ“ makes „X“ point to „XYZ“ in the table *
\n* *
\n* Set up thus, the table can be referenced like this: *
\n* new_letter = X<„A“> new_letter points to „B“ *
\n* new_string = X<„X“> new_string points to „XYZ“ *
\n* null_string = X<„aha“> null_string points to the null string, *
\n* because X<> was not initialized with a *
\n* value for the „aha“ string. *
\n* *
\n*******************************************************************************
\n* *
\n* Limitations: *
\n* *
\n* – Hebrew and Coptic characters are left to later implementation. *
\n* – The program assumes that the reference tags present in TLG\/PHI *
\n* files have been decoded already. At some stage we might modify *
\n* the progran so as to allow for the decoding of entire .txt files *
\n* – As yet, the main focus of the program is to guarantee that the *
\n* main function (beta_convert) works properly; the program itself *
\n* is more of an exercise for this function *
\n* – Use V&F to produce beta code text files. Any other beta code *
\n* text retrieval program might do. Betautf8 assumes that lines starting *
\n* with ~ can be left as they are. If in doubt, modify your file *
\n* (manually) as appropriate *
\n* – With inscriptions, the program produces lots of warning messages *
\n* about lower case letters in Greek. These are normally due to *
\n* letters present in the text as comments or very long reference *
\n* sections. You can safely ignore most of these warnings. *
\n* – As yet, the program does not distinguish between lower case and *
\n* upper case special letters: koppa, stigma, sampi *
\n* – The program uses precombined letter\/accent combinations for Greek *
\n* as much as possible; it does not do so for Latin umlauts etc.<\/abbr>, *
\n* given that these occur only rarely in ancient texts; therefore, *
\n* umlauts may look ugly with certain fonts, especially if they are *
\n* upper case. *
\n* *
\n*******************************************************************************
\n* *
\n* Bugs: *
\n* *
\n* All those errors which we knew about have been removed and replaced by *
\n* completely new ones. *
\n* *
\n* *
\n*******************************************************************************
\n* *
\n* Suggestions for improvements: *
\n* *
\n* – Improve umlauts: Implement a sophisticated switch construct for Latin *
\n* script (similar to the Greek conversion routines) *
\n* – Under CSnobol4\/Snobol4+: FREEZE() all the tables prior to actually *
\n* processing the files. This may lead to a speed increase. Preliminary *
\n* testing, however, shows this speed increase to be significantly lower *
\n* than 4%. Perhaps, this is not worth the while. *
\n* – Coptic, Hebrew *
\n* *
\n*******************************************************************************
\n*
\n* Maximum line length 8 KB
\n* Trim trailing blanks from input lines
\n* Anchored pattern matching: No backing-up at positions 1,2,3…
\n*
\n&maxlngth = 8 * 1024
\n&trim = 1
\n&anchor = 1
\n*
\n*
\n* Systemwide variables guiding the translation process:
\n*
\n*
\nlanguage_latin = „L“
\nlanguage_greek = „G“
\nlanguage_hebrew = „H“
\ndefault_language = language_greek
\nactual_language = default_language
\nuppercase = „“
\n*
\n* Set up vital variables:
\n* numbers = set of digits
\n* lows = set of lower case letters
\n* upps = set of uppercase letters
\n* space = char(32) – space symbol
\n*
\n*
\n*
\nnumbers = „0123456789“
\nlows = &lcase
\nupps = &ucase
\nspace = “ “
\n*
\n* ByteOrder (BOM) marker – unnecessary, but safer
\n*
\nbom = char(239) char(187) char(191)
\n*
\n* This defines the end-of-line-conventions:
\n*
\ncrlf = char(13) char(10)
\nbeta_latin = „&“
\nbeta_greek = „$“
\nbeta_add = „+“
\nbeta_uppercase = „*“
\nbeta_brackets = „[]<>{}“
\nbeta_quotation = ‚“‚
\nbeta_special = „%“
\nbeta_text_modifier = „@^“
\nbeta_sign = „#“
\nbeta_question_mark = „?“
\nbeta_zeichen = „,;.:-_!’`“
\nbeta_dihaeresis = „+“
\nbeta_laccents = „\/=“
\nmarkers = beta_latin beta_greek beta_uppercase beta_brackets
\n+ beta_quotation beta_special beta_text_modifier beta_sign beta_question_mark
\n+ beta_zeichen beta_dihaeresis beta_laccents
\nbeta_iota_sub = „|“
\nbeta_greek_accents = „()\/=+“ beta_iota_sub
\nfinal_sigma_continue = numbers beta_latin beta_greek beta_uppercase
\n+ beta_brackets beta_special beta_text_modifier beta_sign
\n+ beta_question_mark
\nfinal_sigma_stop = space „,;.:_`“ ‚“‚
\nlanguages = table()
\nlanguages<beta_latin> = language_latin
\nlanguages<beta_greek> = language_greek
\nbrackets = table(111)
\nbrackets<„[„> = „[“
\nbrackets<„]“> = „]“
\nbrackets<„[1“> = „(“
\nbrackets<„]1“> = „)“
\nbrackets<„[2“> = „<“
\nbrackets<„]2“> = „>“
\nbrackets<„[3“> = „{“
\nbrackets<„]3“> = „}“
\nbrackets<„[4“> = char(226) char(159) char(166)
\nbrackets<„]4“> = char(226) char(159) char(167)
\nbrackets<„[5“> = char(226) char(140) char(138)
\nbrackets<„]5“> = char(226) char(140) char(139)
\nbrackets<„[6“> = char(226) char(140) char(136)
\nbrackets<„]6“> = char(226) char(140) char(137)
\nbrackets<„[7“> = char(226) char(140) char(136)
\nbrackets<„]7“> = char(226) char(140) char(139)
\nbrackets<„[8“> = char(226) char(140) char(138)
\nbrackets<„]8“> = char(226) char(140) char(137)
\nbrackets<„[9“> = char(206) char(135)
\nbrackets<„]9“> = char(206) char(135)
\nbrackets<„[10“> = „[“
\nbrackets<„]10“> = „]“
\nbrackets<„[11“> = char(226) char(130) char(141)
\nbrackets<„]11“> = char(226) char(130) char(142)
\nbrackets<„[12“> = char(226) char(134) char(146)
\nbrackets<„]12“> = char(226) char(134) char(144)<\/p>\n

brackets<„[13“> = „[“
\nbrackets<„]13“> = „]“
\nbrackets<„[14“> = „|:“
\nbrackets<„]14“> = „:|“
\nbrackets<„[16“> = char(226) char(159) char(166)
\nbrackets<„]16“> = char(226) char(159) char(167)
\nbrackets<„[17“> = char(226) char(140) char(138) char(226) char(140) char(138)
\nbrackets<„]17“> = char(226) char(140) char(139) char(226) char(140) char(139)
\nbrackets<„[18“> = char(226) char(159) char(170)
\nbrackets<„]18“> = char(226) char(159) char(171)
\nbrackets<„[20“> = char(226) char(142) char(167)
\nbrackets<„]20“> = char(226) char(142) char(171)
\nbrackets<„[21“> = char(226) char(142) char(170)
\nbrackets<„]21“> = char(226) char(142) char(170)
\nbrackets<„[22“> = char(226) char(142) char(168)
\nbrackets<„]22“> = char(226) char(142) char(172)
\nbrackets<„[23“> = char(226) char(142) char(169)
\nbrackets<„]23“> = char(226) char(142) char(173)
\nbrackets<„[30“> = char(226) char(142) char(155)
\nbrackets<„]30“> = char(226) char(142) char(158)
\nbrackets<„[31“> = char(226) char(142) char(156)
\nbrackets<„]31“> = char(226) char(142) char(159)
\nbrackets<„[32“> = char(226) char(142) char(157)
\nbrackets<„]32“> = char(226) char(142) char(160)
\n*
\n* The intermediate values have been reserved for special purposes
\n*
\nbrackets<„[70“> = char(226) char(184) char(130)
\nbrackets<„]70“> = char(226) char(184) char(131)
\nbrackets<„[71“> = char(226) char(184) char(132)
\nbrackets<„]71“> = char(226) char(184) char(133)
\nbrackets<„[72“> = char(226) char(184) char(137)
\nbrackets<„]72“> = char(226) char(184) char(138)
\nbrackets<„[73“> = char(226) char(184) char(139)
\nbrackets<„]73“> = char(226) char(184) char(140)
\nbrackets<„[80“> = „\/“
\nbrackets<„]80“> = „\/“
\nbrackets<„[81“> = „\/\/“
\nbrackets<„]81“> = „\/\/“
\n*
\n* pointed brackets:
\n*
\nbrackets<„<2“> = char(226) char(128) char(181)
\nbrackets<„>2“> = char(226) char(128) char(178)
\nbrackets<„<6“> = „“
\nbrackets<„>6“> = „\/“
\nbrackets<„<11“> = „“
\nbrackets<„>11“> = „\/“
\nbrackets<„<16“> = char(226) char(128) char(181)
\n*
\n* Error corrected 5-7-2009 B.M.
\n*
\n* V this was 116 – probably an error
\nbrackets<„>16“> = char(226) char(128) char(178)
\nbrackets<„<19“> = char(226) char(128) char(181)
\nbrackets<„>19“> = char(226) char(128) char(178)
\n*
\n* Tables for special symbols:
\n*
\nquote = table(11)
\nquote<„0“> = ‚“‚
\nquote<„1“> = char(226) char(128) char(158)
\nquote<„2“> = ‚“‚
\nquote<„3“> = „‚“
\nquote<„4“> = „,“
\nquote<„5“> = „‚“
\nquote<„6“> = ‚“‚
\nquote<„7“> = „‚“
\nquote<„8“> = char(226) char(128) char(158)
\n*
\ngreek_zeichen = table(11)
\nlatin_zeichen = table(11)
\n*
\ngreek_zeichen<„,“> = „,“
\ngreek_zeichen<„;“> = „;“
\ngreek_zeichen<„.“> = „.“
\ngreek_zeichen<„:“> = char(206) char(135)
\ngreek_zeichen<„-„> = „-“
\ngreek_zeichen<„_“> = “ – “
\ngreek_zeichen<„!“> = char(32) char(204) char(163)
\ngreek_zeichen<„‚“> = „‚“
\n*
\nlatin_zeichen<„,“> = „,“
\nlatin_zeichen<„;“> = „;“
\nlatin_zeichen<„.“> = „.“
\nlatin_zeichen<„:“> = „:“
\nlatin_zeichen<„-„> = „-“
\nlatin_zeichen<„!“> = „!“
\nlatin_zeichen<„‚“> = „‚“
\n*
\n* Tables for % and # (non-alphabetic signs\/symbolic signs)
\n*
\npercent = table(250)
\nhash = table(900)
\n*
\n* Values – initialization of the tables:
\n*
\npercent<„%“> = char(226) char(128) char(160)
\npercent<„%1“> = „%1“
\npercent<„%2“> = „*“
\npercent<„%3“> = „\/“
\npercent<„%4“> = „%4“
\npercent<„%5“> = „|“
\npercent<„%6“> = „=“
\npercent<„%7“> = „+“
\npercent<„%8“> = „%“
\npercent<„%9“> = „&“
\npercent<„%10“> = „:“
\npercent<„%11“> = char(226) char(128) char(162)
\npercent<„%12“> = „*“
\npercent<„%13“> = char(226) char(128) char(161)
\npercent<„%14“> = char(194) char(167)
\npercent<„%15“> = char(203) char(136)
\npercent<„%16“> = char(194) char(166)
\npercent<„%17“> = char(226) char(128) char(150)
\npercent<„%18“> = „‚“
\npercent<„%19“> = char(226) char(128) char(147)
\npercent<„%20“> = char(204) char(129)
\npercent<„%21“> = char(204) char(128)
\npercent<„%22“> = char(204) char(130)
\npercent<„%23“> = char(204) char(136)
\npercent<„%24“> = char(204) char(131)
\npercent<„%25“> = char(204) char(167)
\npercent<„%26“> = char(204) char(132)
\npercent<„%27“> = char(204) char(134)
\npercent<„%28“> = char(204) char(136)
\npercent<„%29“> = char(204) char(164)
\npercent<„%30“> = char(32) char(204) char(147)
\npercent<„%31“> = char(225) char(191) char(190)
\npercent<„%32“> = char(32) char(204) char(129)
\npercent<„%33“> = char(32) char(204) char(128)
\npercent<„%34“> = char(32) char(204) char(130)
\npercent<„%35“> = char(32) char(225) char(191) char(142)
\npercent<„%36“> = char(32) char(225) char(191) char(158)
\npercent<„%37“> = char(32) char(225) char(191) char(157)
\npercent<„%38“> = char(32) char(225) char(191) char(159)
\npercent<„%39“> = char(32) char(204) char(136)
\npercent<„%40“> = char(32) char(204) char(134)
\npercent<„%41“> = char(32) char(204) char(133)
\npercent<„%42“> = char(226) char(143) char(149)
\npercent<„%43“> = char(195) char(151)
\npercent<„%44“> = char(32) char(204) char(174) char(204) char(133)
\npercent<„%45“> = char(32) char(204) char(178) char(204) char(134)
\npercent<„%46“> = char(32) char(204) char(171) char(204) char(133)
\npercent<„%47“> = char(32) char(204) char(178) char(204) char(133)
\npercent<„%48“> = char(32) char(204) char(174) char(204) char(134)
\npercent<„%49“> =
\npercent<„%50“> = „1\/2“
\npercent<„%51“> = „1\/4“
\npercent<„%52“> = „1\/8“
\npercent<„%53“> = „1\/16“
\npercent<„%54“> = „1\/32“
\npercent<„%55“> = „1\/64“
\npercent<„%56“> = „1\/128“
\npercent<„%57“> =
\npercent<„%58“> =
\npercent<„%59“> = „3\/4“
\npercent<„%60“> = „1\/3“
\npercent<„%61“> = „1\/6“
\npercent<„%62“> = „1\/12“
\npercent<„%63“> = „1\/24“
\npercent<„%64“> = „1\/48“
\npercent<„%65“> = „1\/96“
\npercent<„%66“> =
\npercent<„%67“> =
\npercent<„%68“> =
\npercent<„%69“> = „2\/3“
\npercent<„%70“> = „1\/50“
\npercent<„%71“> = „1\/100“
\npercent<„%72“> = „1\/15“
\npercent<„%73“> = „1\/30“
\npercent<„%74“> =
\npercent<„%75“> =
\npercent<„%76“> =
\npercent<„%77“> =
\npercent<„%78“> =
\npercent<„%79“> =
\npercent<„%80“> = „v“
\npercent<„%81“> = „vac.“
\npercent<„%91“> = char(226) char(138) char(162)
\npercent<„%92“> = char(226) char(138) char(163)
\npercent<„%93“> = char(204) char(128) char(204) char(137)
\npercent<„%94“> = char(204) char(135)
\npercent<„%96“> = char(204) char(146)
\npercent<„%97“> = char(204) char(136)
\npercent<„%98“> = char(204) char(142)
\npercent<„%100“> = „;“
\npercent<„%101“> = „#“
\npercent<„%102“> = „`“
\npercent<„%103“> = „“
\npercent<„%104“> = „^“
\npercent<„%105“> = „|||“
\npercent<„%106“> = char(226) char(137) char(133)
\npercent<„%107“> = „~“
\npercent<„%108“> = char(194) char(177)
\npercent<„%109“> = char(226) char(128) char(162)
\npercent<„%110“> = char(226) char(151) char(139)
\npercent<„%127“> = char(204) char(175)
\npercent<„%128“> = char(204) char(140)
\npercent<„%129“> = char(226) char(128) char(160)
\npercent<„%130“> = char(204) char(135)
\npercent<„%132“> = char(206) char(133)
\npercent<„%133“> = char(225) char(191) char(141)
\npercent<„%134“> = char(225) char(191) char(143)
\npercent<„%138“> = char(226) char(143) char(145) char(204) char(129)
\npercent<„%141“> = char(226) char(143) char(150)
\npercent<„%142“> = char(226) char(148) char(144)
\npercent<„%144“> = char(226) char(143) char(145) char(204) char(182)
\npercent<„%145“> = char(226) char(128) char(147) char(204) char(129)
\npercent<„%146“> = char(194) char(183)
\npercent<„%147“> = char(204) char(138)
\npercent<„%148“> = char(204) char(140)
\npercent<„%149“> = char(204) char(168)
\npercent<„%150“> = char(124)
\npercent<„%154“> = char(226) char(136) char(180)
\npercent<„%155“> = char(226) char(136) char(181)
\npercent<„%158“> = char(226) char(129) char(130)
\npercent<„%159“> = char(195) char(151)
\npercent<„%160“> = char(45)
\npercent<„%161“> = char(195) char(183)
\npercent<„%163“> = char(194) char(182)
\npercent<„%170“> = char(205) char(153)
\npercent<„%171“> = „\/\/“
\npercent<„%172“> = char(202) char(188)
\npercent<„%173“> = char(202) char(189)
\npercent<„%174“> = char(194) char(180)
\npercent<„%175“> = char(96)
\npercent<„%176“> = char(225) char(191) char(128)
\npercent<„%177“> = char(204) char(147)
\npercent<„%178“> = char(204) char(148)
\npercent<„%179“> = char(204) char(163)
\n*
\n*
\ngreek_percent = table(7)
\ngreek_percent<„1“> = „?“
\ngreek_percent<„4“> = „!“
\nlatin_percent = table(7)
\nlatin_percent<„1“> = char(204) char(163)
\nlatin_percent<„4“> = char(32) char(204) char(163)
\n*
\nhash<„#“> = „‚“
\nhash<„#1“> = char(207) char(159)
\nhash<„#2“> = char(207) char(154)
\nhash<„#3“> = char(207) char(158)
\nhash<„#4“> = „Q“
\nhash<„#5“> = char(207) char(160)
\nhash<„#6“> = char(226) char(184) char(143)
\nhash<„#7“> = char(32) char(204) char(163)
\nhash<„#8“> = char(226) char(184) char(144)
\nhash<„#9“> = char(204) char(129)
\nhash<„#10“> = char(207) char(189)
\nhash<„#11“> = char(207) char(191)
\nhash<„#12“> = char(226) char(128) char(148)
\nhash<„#13“> = char(226) char(128) char(187)
\nhash<„#14“> = char(226) char(184) char(150)
\nhash<„#15“> = „>“
\nhash<„#16“> = char(207) char(190)
\nhash<„#17“> = „\/“
\nhash<„#18“> = „<“
\nhash<„#19“> = char(204) char(128)
\nhash<„#20“> = char(226) char(151) char(161)
\nhash<„#21“> = char(226) char(136) char(189) char(204) char(136)
\nhash<„#22“> = char(205) char(181)
\nhash<„#23“> = char(207) char(152)
\nhash<„#24“> = char(226) char(136) char(189) char(204) char(136)
\nhash<„#25“> = char(226) char(136) char(189) char(204) char(136)
\nhash<„#26“> = char(226) char(184) char(143)
\nhash<„#27“> = char(226) char(136) char(154)
\nhash<„#28“> = „Deleted “
\nhash<„#29“> = char(194) char(183)
\nhash<„#51“> = char(194) char(183)
\nhash<„#52“> = char(226) char(129) char(154)
\nhash<„#53“> = char(226) char(129) char(157)
\nhash<„#54“> = „center of line “
\nhash<„#55“> = char(226) char(129) char(153)
\nhash<„#56“> = „Dividers of other forms “
\nhash<„#59“> = char(207) char(189)
\nhash<„#60“> = char(206) char(153)
\nhash<„#61“> = „1 drachma “
\nhash<„#62“> = „5 drachmas “
\nhash<„#63“> = char(206) char(148)
\nhash<„#64“> = „50 drachmas “
\nhash<„#65“> = char(206) char(151)
\nhash<„#66“> = „500 drachmas “
\nhash<„#67“> = char(206) char(167)
\nhash<„#68“> = „5 000 drachmas “
\nhash<„#69“> = char(206) char(156)
\nhash<„#70“> = „.“
\nhash<„#71“> = char(194) char(183)
\nhash<„#72“> = char(203) char(153)
\nhash<„#73“> = char(226) char(129) char(154)
\nhash<„#74“> = char(226) char(129) char(157)
\nhash<„#75“> = „.“
\nhash<„#80“> = char(204) char(136)
\nhash<„#81“> = „‚“
\nhash<„#82“> = char(203) char(138)
\nhash<„#83“> = char(203) char(139)
\nhash<„#84“> = char(225) char(191) char(128)
\nhash<„#85“> = char(202) char(189)
\nhash<„#86“> = char(202) char(188)
\nhash<„#87“> = char(206) char(148) char(205) char(133)
\nhash<„#90“> = char(226) char(128) char(148)
\nhash<„#99“> = char(32) char(204) char(163)
\nhash<„#103“> = char(206) char(155) char(204) char(184)
\nhash<„#118“> = char(206) char(187) char(204) char(184)
\nhash<„#121“> = char(206) char(190) char(204) char(184)
\nhash<„#127“> = char(206) char(187) char(205) char(133)
\nhash<„#128“> = char(207) char(188)
\nhash<„#129“> = char(206) char(155) char(204) char(165)
\nhash<„#132“> = char(206) char(178) char(204) char(184)
\nhash<„#135“> = char(203) char(153)
\nhash<„#136“> = char(206) char(163)
\nhash<„#150“> = char(226) char(136) char(158)
\nhash<„#151“> = char(226) char(128) char(148)
\nhash<„#152“> = char(226) char(129) char(154) char(226) char(128) char(148)
\nhash<„#153“> = char(226) char(128) char(166) char(204) char(133)
\nhash<„#154“> = char(226) char(178) char(128)
\nhash<„#155“> = char(226) char(128) char(148) char(204) char(163)
\nhash<„#156“> = char(226) char(140) char(144)
\nhash<„#158“> = char(226) char(136) char(183) char(204) char(182)
\nhash<„#159“> = char(226) char(136) char(183) char(204) char(180)
\nhash<„#160“> = char(126) char(204) char(163)
\nhash<„#162“> = char(226) char(150) char(161)
\nhash<„#163“> = char(205) char(181)
\nhash<„#165“> = char(32) char(204) char(189)
\nhash<„#166“> = char(226) char(169) char(154)
\nhash<„#170“> = „II“
\nhash<„#200“> = char(226) char(153) char(131)
\nhash<„#201“> = char(226) char(152) char(141)
\nhash<„#202“> = char(226) char(153) char(143)
\nhash<„#203“> = char(226) char(153) char(141)
\nhash<„#204“> = char(226) char(153) char(128)
\nhash<„#205“> = char(226) char(153) char(144)
\nhash<„#206“> = char(226) char(153) char(132)
\nhash<„#207“> = char(226) char(152) char(137)
\nhash<„#208“> = char(226) char(152) char(191)
\nhash<„#209“> = char(226) char(152) char(190)
\nhash<„#210“> = char(226) char(153) char(130)
\nhash<„#211“> = char(226) char(153) char(145)
\nhash<„#212“> = char(226) char(152) char(138)
\nhash<„#213“> = char(226) char(153) char(136)
\nhash<„#214“> = char(226) char(153) char(142)
\nhash<„#215“> = char(226) char(153) char(138)
\nhash<„#216“> = char(226) char(153) char(139)
\nhash<„#217“> = char(226) char(153) char(133)
\nhash<„#218“> = char(226) char(153) char(146)
\nhash<„#219“> = char(226) char(153) char(137)
\nhash<„#220“> = char(226) char(152) char(141)
\nhash<„#221“> = char(226) char(152) char(189)
\nhash<„#222“> = char(226) char(152) char(140)
\nhash<„#241“> = char(226) char(152) char(139)
\nhash<„#242“> = char(226) char(153) char(145)
\nhash<„#244“> = char(226) char(153) char(140)
\nhash<„#245“> = char(226) char(153) char(142) char(204) char(189)
\nhash<„#249“> = char(207) char(128) char(226) char(152) char(190)
\n*
\n* 2006-01-27:
\n*<\/p>\n

hash<„#300“> = char(226) char(135) char(131)
\nhash<„#303“> = „>“
\nhash<„#305“> = char(226) char(184) char(142)
\nhash<„#306“> = char(226) char(137) char(144)
\n*
\n* 2006-01-27:
\n*
\nhash<„#307“> = char(226) char(134) char(190)
\n*
\nhash<„#308“> = char(226) char(134) char(189)
\nhash<„#310“> = char(226) char(184) char(142)
\nhash<„#313“> = char(226) char(184) char(142)
\nhash<„#314“> = char(226) char(136) char(146) char(226) char(136) char(152)
\nhash<„#315“> = char(226) char(184) char(142)
\nhash<„#317“> = „\/“
\nhash<„#319“> = char(226) char(151) char(143)
\nhash<„#320“> = char(226) char(152) char(169)
\nhash<„#323“> = „>“
\nhash<„#321“> = char(226) char(152) char(169)
\nhash<„#322“> = char(226) char(152) char(167)
\nhash<„#324“> = char(226) char(128) char(148)
\nhash<„#330“> = „{Drawing}“
\nhash<„#336“> = char(213) char(143)
\nhash<„#451“> = char(202) char(131)
\nhash<„#452“> = char(226) char(184) char(144)
\nhash<„#453“> = char(226) char(184) char(145)
\nhash<„#454“> = char(226) char(184) char(144)
\nhash<„#455“> = char(226) char(184) char(145)
\nhash<„#458“> = char(206) char(167)
\nhash<„#459“> = char(194) char(183)
\nhash<„#460“> = char(226) char(128) char(148)
\nhash<„#461“> = „|“
\nhash<„#465“> = char(226) char(152) char(167)
\nhash<„#468“> = char(226) char(184) char(142)
\nhash<„#476“> = char(202) char(131)
\nhash<„#504“> = char(226) char(184) char(142)
\nhash<„#505“> = char(226) char(129) char(156)
\nhash<„#506“> = char(226) char(184) char(148)
\nhash<„#507“> = char(226) char(184) char(149)
\nhash<„#508“> = char(226) char(128) char(187)
\nhash<„#509“> = char(204) char(133) char(204) char(145)
\nhash<„#512“> = char(207) char(189)
\nhash<„#516“> = char(206) char(148) char(205) char(133)
\nhash<„#519“> = char(226) char(134) char(145)
\nhash<„#520“> = char(226) char(152) char(169)
\nhash<„#523“> = char(226) char(184) char(147)
\nhash<„#524“> = char(226) char(138) char(151)
\nhash<„#525“> = char(226) char(156) char(155)
\nhash<„#526“> = char(226) char(134) char(144)
\nhash<„#527“> = char(203) char(134)
\nhash<„#528“> = char(206) char(187) char(204) char(173)
\nhash<„#529“> = char(226) char(129) char(139)
\nhash<„#531“> = char(205) char(156)
\nhash<„#532“> = char(226) char(184) char(146)
\nhash<„#533“> = char(207) char(154)
\nhash<„#534“> = char(204) char(130)
\nhash<„#542“> = char(206) char(161) char(204) char(182)
\nhash<„#544“> = char(226) char(129) char(152)
\nhash<„#548“> = char(226) char(128) char(150) char(204) char(180)
\nhash<„#550“> = „::“
\nhash<„#551“> = char(226) char(151) char(140)
\nhash<„#556“> = char(226) char(152) char(169)
\nhash<„#561“> = char(226) char(134) char(145)
\nhash<„#562“> = char(204) char(133)
\nhash<„#570“> = char(207) char(188)
\nhash<„#574“> = char(206) char(147)
\nhash<„#577“> = char(206) char(166)
\nhash<„#578“> = char(206) char(161)
\nhash<„#579“> = char(206) char(156)
\nhash<„#580“> = char(206) char(153)
\nhash<„#581“> = char(206) char(152)
\nhash<„#583“> = char(206) char(157)
\nhash<„#584“> = char(226) char(132) char(167)
\nhash<„#585“> = char(206) char(150)
\nhash<„#587“> = char(206) char(149)
\nhash<„#593“> = char(206) char(155)
\nhash<„#598“> = char(206) char(148)
\nhash<„#603“> = char(206) char(160)
\nhash<„#617“> = char(206) char(169)
\nhash<„#619“> = char(206) char(187)
\nhash<„#623“> = char(226) char(132) char(167)
\nhash<„#624“> = char(207) char(189)
\nhash<„#628“> = char(206) char(159)
\nhash<„#629“> = char(206) char(158)
\nhash<„#630“> = char(206) char(148)
\n*
\nhash<„#631“> = char(206) char(154)
\nhash<„#641“> = char(206) char(169)
\nhash<„#642“> = char(206) char(151)
\nhash<„#651“> = char(206) char(167)
\nhash<„#652“> = char(206) char(164)
\nhash<„#660“> = char(206) char(145)
\nhash<„#661“> = char(206) char(146)
\nhash<„#662“> = char(206) char(165)
\nhash<„#663“> = char(206) char(168)
\nhash<„#677“> = char(206) char(188)
\nhash<„#683“> = char(226) char(156) char(179)
\nhash<„#688“> = char(206) char(188) char(204) char(138)
\nhash<„#689“> = char(226) char(151) char(161)
\nhash<„#690“> = char(226) char(159) char(152)
\nhash<„#691“> = char(226) char(159) char(128)
\nhash<„#692“> = char(226) char(159) char(129)
\nhash<„#694“> = char(206) char(150)
\nhash<„#695“> = char(226) char(128) char(148)
\nhash<„#700“> = char(226) char(129) char(158)
\nhash<„#703“> = char(226) char(151) char(139) char(226) char(151)
\n+ char(139) char(226) char(151) char(139)
\nhash<„#704“> = char(226) char(128) char(148) char(204) char(135)
\nhash<„#709“> = char(226) char(136) char(187)
\nhash<„#710“> = char(206) char(154) char(204) char(182)
\nhash<„#711“> = char(207) char(187)
\nhash<„#717“> = char(226) char(184) char(128)
\nhash<„#718“> = char(226) char(184) char(129)
\nhash<„#719“> = char(226) char(184) char(134)
\nhash<„#720“> = char(226) char(184) char(135)
\nhash<„#722“> = char(226) char(132) char(181)
\nhash<„#724“> = char(226) char(132) char(140)
\nhash<„#730“> = char(226) char(128) char(148)
\nhash<„#731“> = char(226) char(143) char(151)
\nhash<„#732“> = char(226) char(143) char(152)
\nhash<„#733“> = char(226) char(143) char(153)
\nhash<„#751“> = char(217) char(161)
\nhash<„#752“> = char(217) char(162)
\nhash<„#753“> = char(217) char(163)
\nhash<„#754“> = char(217) char(164)
\nhash<„#755“> = char(217) char(165)
\nhash<„#756“> = char(217) char(166)
\nhash<„#757“> = char(217) char(167)
\nhash<„#758“> = char(217) char(168)
\nhash<„#759“> = char(217) char(169)
\nhash<„#760“> = char(217) char(160)
\nhash<„#762“> = char(203) char(153)
\nhash<„#800“> = char(226) char(156) char(179)
\n*
\nhash<„#801“> = „1\/2 obol. “
\nhash<„#802“> = „1\/4 obol. “
\nhash<„#803“> = char(206) char(167)
\nhash<„#804“> = „\/“
\nhash<„#805“> = char(206) char(164)
\nhash<„#806“> = char(206) char(154)
\nhash<„#807“> = „5 obols “
\nhash<„#808“> = „5\/4 obol “
\nhash<„#811“> = char(206) char(164)
\nhash<„#812“> = „5 talents “
\nhash<„#813“> = „10 talents “
\nhash<„#814“> = „50 talents “
\nhash<„#815“> = „100 talents “
\nhash<„#816“> = „500 talents “
\nhash<„#817“> = „1,000 talents “
\nhash<„#818“> = „5,000 talents “
\nhash<„#819“> = „10,000 talents “
\nhash<„#821“> = char(206) char(163)
\nhash<„#822“> = „5 staters “
\nhash<„#823“> = „10 staters “
\nhash<„#824“> = „50 staters “
\nhash<„#825“> = „100 staters “
\nhash<„#826“> = „500 staters “
\nhash<„#827“> = „1,000 staters “
\nhash<„#828“> = „5,000 staters “
\nhash<„#829“> = „10,000 staters “
\nhash<„#830“> = „50,000 drachmas “
\nhash<„#831“> = „50,000 talents “
\nhash<„#832“> = „50,000 staters “
\nhash<„#833“> = char(206) char(156)
\nhash<„#834“> = „10 minae “
\nhash<„#835“> = char(206) char(167)
\nhash<„#836“> = char(206) char(163)
\nhash<„#837“> = char(206) char(164)
\nhash<„#838“> = „5 chalkeioi “
\nhash<„#839“> = „6 chalkeioi “
\nhash<„#840“> = „||“
\nhash<„#841“> = „|||“
\nhash<„#842“> = char(194) char(183)
\nhash<„#843“> = „2 drachmas “
\nhash<„#844“> = char(226) char(129) char(157)
\nhash<„#845“> = „5 drachmas “
\nhash<„#846“> = „10 drachmas “
\nhash<„#847“> = „20 drachmas “
\nhash<„#848“> = „30 drachmas “
\nhash<„#850“> = „100,000 drachmas “
\nhash<„#853“> = char(206) char(153)
\nhash<„#862“> = char(206) char(148)
\nhash<„#863“> = „50 “
\nhash<„#865“> = „500 “
\nhash<„#866“> = char(206) char(167)
\nhash<„#867“> = „5,000 “
\nhash<„#900“> = char(226) char(153) char(164)
\nhash<„#901“> = char(226) char(156) char(135)
\nhash<„#927“> = „W“
\nhash<„#932“> = char(226) char(156) char(179)
\nhash<„#938“> = char(198) char(167)
\nhash<„#939“> = „~“
\nhash<„#1000“> = „1 obol “
\nhash<„#1001“> = „2 obols “
\nhash<„#1002“> = „3 obols “
\nhash<„#1003“> = „4 obols “
\nhash<„#1004“> = „5 obols “
\nhash<„#1005“> = char(206) char(167)
\nhash<„#1006“> = „1 chalkus “
\nhash<„#1007“> = „2 chalkoi “
\nhash<„#1008“> = „3 chalkoi “
\nhash<„#1009“> = „4 chalkoi “
\nhash<„#1010“> = „5 chalkoi “
\nhash<„#1011“> = „6 chalkoi “
\nhash<„#1012“> = „7 chalkoi “
\nhash<„#1013“> = „1\/2 chalkus “
\nhash<„#1020“> = „<“
\nhash<„#1021“> = char(206) char(148) char(205) char(180)
\nhash<„#1022“> = char(206) char(151) char(205) char(180)
\nhash<„#1023“> = char(206) char(153) char(205) char(180)
\nhash<„#1024“> = char(206) char(155) char(206) char(146)
\nhash<„#1100“> = char(226) char(134) char(131)
\nhash<„#1103“> = char(204) char(163) char(204) char(147)
\nhash<„#1105“> = char(77) char(204) char(138)
\nhash<„#1107“> = char(83) char(204) char(181) char(83) char(204) char(182)
\nhash<„#1108“> = char(88) char(204) char(182)
\nhash<„#1109“> = „=“
\nhash<„#1110“> = „-“
\nhash<„#1111“> = char(194) char(176)
\nhash<„#1115“> = „|“
\nhash<„#1116“> = char(198) char(167)
\nhash<„#1117“> = „Z“
\nhash<„#1119“> = char(196) char(144)
\nhash<„#1121“> = „Z“
\nhash<„#1124“> = char(226) char(132) char(158)
\nhash<„#1126“> = „O“
\nhash<„#1127“> = char(118) char(204) char(184)
\nhash<„#1128“> = char(73) char(204) char(182) char(73) char(204)
\n+ char(182) char(73) char(204) char(182)
\nhash<„#1129“> = char(90) char(204) char(182)
\nhash<„#1130“> = „“
\nhash<„#1131“> = „\\“
\nhash<„#1132“> = char(92) char(204) char(182)
\nhash<„#1133“> = char(92) char(204) char(182) char(92) char(204) char(182)
\nhash<„#1135“> = „9“
\nhash<„#1136“> = char(226) char(132) char(146)
\nhash<„#1200“> = char(194) char(162)
\nhash<„#1201“> = char(226) char(128) char(161)
\nhash<„#1202“> = char(226) char(130) char(164)
\nhash<„#1203“> = char(195) char(159)
\nhash<„#1204“> = char(194) char(176)
\nhash<„#1209“> = char(196) char(167)
\nhash<„#1212“> = char(68) char(204) char(182)
\nhash<„#1213“> = char(197) char(146)
\nhash<„#1214“> = char(197) char(147)
\nhash<„#1215“> = char(195) char(134)
\nhash<„#1216“> = char(195) char(166)
\nhash<„#1219“> = „$“
\nhash<„#1220“> = „@“
\nhash<„#1221“> = char(196) char(177)
\nhash<„#1222“> = char(196) char(176)
\nhash<„#1223“> = char(105) char(204) char(182)
\nhash<„#1224“> = char(226) char(138) char(149)
\nhash<„#1225“> = char(194) char(169)
\nhash<„#1226“> = char(226) char(156) char(177)
\nhash<„#1227“> = char(226) char(128) char(161)
\nhash<„#1230“> = char(226) char(150) char(173)
\nhash<„#1312“> = char(77) char(226) char(128) char(153)
\nhash<„#1313“> = char(226) char(136) char(189)
\nhash<„#1314“> = char(119) char(204) char(138)
\nhash<„#1316“> = char(202) char(146)
\nhash<„#1317“> = char(203) char(153) char(47) char(47) char(46)
\nhash<„#1318“> = char(226) char(136) char(187)
\nhash<„#1320“> = char(205) char(181) char(204) char(145)
\nhash<„#1322“> = char(226) char(153) char(132)
\nhash<„#1323“> = char(206) char(182) char(204) char(183)
\n+ char(207) char(130) char(204) char(128)
\nhash<„#1324“> = char(206) char(184) char(207) char(130) char(204) char(130)
\nhash<„#1335“> = „\/\/“
\nhash<„#1337“> = „>“
\nhash<„#1500“> = char(206) char(179) char(204) char(138)
\nhash<„#1502“> = char(206) char(167) char(205) char(180)
\nhash<„#1506“> = char(204) char(128) char(204) char(140)
\nhash<„#1512“> = „<“
\nhash<„#1513“> = char(226) char(151) char(161)
\nhash<„#1514“> = char(195) char(183)
\nhash<„#1521“> = char(200) char(162)
\nhash<„#1523“> = char(226) char(129) char(155)
\n*
\n*
\n* Special tables for UNICODE diacritic letters (combining):
\n*
\n*
\ngreek_diacritics = table()
\ngreek_diacritics<„?“> = char(204) char(163)
\n*
\n* Letter-accent tables
\n*
\n*
\ngreek_upper_tab = table(200)
\ngreek_lower_tab = table(200)
\n*
\n*
\n*******************************************************************************
\n* *
\n* *
\n* Uppercase Greek table: *
\n* semi-automatically generated – do not touch! *
\n* *
\n* *
\n*******************************************************************************
\n*
\n*
\n* „\u00ce\u2018“ – 206:145 = CE 91
\ngreek_upper_tab<„A“> = char(206) char(145)
\n* „\u00ce\u2019“ – 206:146 = CE 92
\ngreek_upper_tab<„B“> = char(206) char(146)
\n* „\u00ce\u201c“ – 206:147 = CE 93
\ngreek_upper_tab<„G“> = char(206) char(147)
\n* „\u00ce\u201d“ – 206:148 = CE 94
\ngreek_upper_tab<„D“> = char(206) char(148)
\n* „\u00ce\u2022“ – 206:149 = CE 95
\ngreek_upper_tab<„E“> = char(206) char(149)
\n* „\u00ce\u2013“ – 206:150 = CE 96
\ngreek_upper_tab<„Z“> = char(206) char(150)
\n* „\u00ce\u2014“ – 206:151 = CE 97
\ngreek_upper_tab<„H“> = char(206) char(151)
\n* „\u00ce\u02dc“ – 206:152 = CE 98
\ngreek_upper_tab<„Q“> = char(206) char(152)
\n* „\u00ce\u2122“ – 206:153 = CE 99
\ngreek_upper_tab<„I“> = char(206) char(153)
\n* Attic aspiration
\ngreek_upper_tab<„J“> = „H“
\n* „\u00ce\u0161“ – 206:154 = CE 9A
\ngreek_upper_tab<„K“> = char(206) char(154)
\n* „\u00ce\u203a“ – 206:155 = CE 9B
\ngreek_upper_tab<„L“> = char(206) char(155)
\n* „\u00ce\u0153“ – 206:156 = CE 9C
\ngreek_upper_tab<„M“> = char(206) char(156)
\n* „\u00ce\u009d“ – 206:157 = CE 9D
\ngreek_upper_tab<„N“> = char(206) char(157)
\n* „\u00ce\u017e“ – 206:158 = CE 9E
\ngreek_upper_tab<„C“> = char(206) char(158)
\n* „\u00ce\u0178“ – 206:159 = CE 9F
\ngreek_upper_tab<„O“> = char(206) char(159)
\n* „\u00ce\u00a0“ – 206:160 = CE A0
\ngreek_upper_tab<„P“> = char(206) char(160)
\n* „\u00ce\u00a1“ – 206:161 = CE A1
\ngreek_upper_tab<„R“> = char(206) char(161)
\n* „\u00ce\u00a3“ – 206:163 = CE A3
\ngreek_upper_tab<„S“> = char(206) char(163)
\n* „\u00ce\u00a4“ – 206:164 = CE A4
\ngreek_upper_tab<„T“> = char(206) char(164)
\n* „\u00ce\u00a5“ – 206:165 = CE A5
\ngreek_upper_tab<„U“> = char(206) char(165)
\n* „\u00ce\u00a6“ – 206:166 = CE A6
\ngreek_upper_tab<„F“> = char(206) char(166)
\n* „\u00ce\u00a7“ – 206:167 = CE A7
\ngreek_upper_tab<„X“> = char(206) char(167)
\n* „\u00ce\u00a8“ – 206:168 = CE A8
\ngreek_upper_tab<„Y“> = char(206) char(168)
\n* „\u00ce\u00a9“ – 206:169 = CE A9
\ngreek_upper_tab<„W“> = char(206) char(169)
\n* \u00e1\u00bc\u02c6 – 225:188:136 = E1 BC 88
\ngreek_upper_tab<„)A“> = char(225) char(188) char(136)
\n* \u00e1\u00bc\u2030 – 225:188:137 = E1 BC 89
\ngreek_upper_tab<„(A“> = char(225) char(188) char(137)
\n* \u00e1\u00bc\u0160 – 225:188:138 = E1 BC 8A
\ngreek_upper_tab<„)A“> = char(225) char(188) char(138)
\n* \u00e1\u00bc\u2039 – 225:188:139 = E1 BC 8B
\ngreek_upper_tab<„(A“> = char(225) char(188) char(139)
\n* \u00e1\u00bc\u0152 – 225:188:140 = E1 BC 8C
\ngreek_upper_tab<„)\/A“> = char(225) char(188) char(140)
\n* \u00e1\u00bc\u008d – 225:188:141 = E1 BC 8D
\ngreek_upper_tab<„(\/A“> = char(225) char(188) char(141)
\n* \u00e1\u00bc\u017d – 225:188:142 = E1 BC 8E
\ngreek_upper_tab<„)=A“> = char(225) char(188) char(142)
\n* \u00e1\u00bc\u008f – 225:188:143 = E1 BC 8F
\ngreek_upper_tab<„(=A“> = char(225) char(188) char(143)
\n* \u00e1\u00bc\u02dc – 225:188:152 = E1 BC 98
\ngreek_upper_tab<„)E“> = char(225) char(188) char(152)
\n* \u00e1\u00bc\u2122 – 225:188:153 = E1 BC 99
\ngreek_upper_tab<„(E“> = char(225) char(188) char(153)
\n* \u00e1\u00bc\u0161 – 225:188:154 = E1 BC 9A
\ngreek_upper_tab<„)E“> = char(225) char(188) char(154)
\n* \u00e1\u00bc\u203a – 225:188:155 = E1 BC 9B
\ngreek_upper_tab<„(E“> = char(225) char(188) char(155)
\n* \u00e1\u00bc\u0153 – 225:188:156 = E1 BC 9C
\ngreek_upper_tab<„)\/E“> = char(225) char(188) char(156)
\n* \u00e1\u00bc\u009d – 225:188:157 = E1 BC 9D
\ngreek_upper_tab<„(\/E“> = char(225) char(188) char(157)
\n* \u00e1\u00bc\u00a8 – 225:188:168 = E1 BC A8
\ngreek_upper_tab<„)H“> = char(225) char(188) char(168)
\n* \u00e1\u00bc\u00a9 – 225:188:169 = E1 BC A9
\ngreek_upper_tab<„(H“> = char(225) char(188) char(169)
\n* \u00e1\u00bc\u00aa – 225:188:170 = E1 BC AA
\ngreek_upper_tab<„)H“> = char(225) char(188) char(170)
\n* \u00e1\u00bc\u00ab – 225:188:171 = E1 BC AB
\ngreek_upper_tab<„(H“> = char(225) char(188) char(171)
\n* \u00e1\u00bc\u00ac – 225:188:172 = E1 BC AC
\ngreek_upper_tab<„)\/H“> = char(225) char(188) char(172)
\n* \u00e1\u00bc\u00ad – 225:188:173 = E1 BC AD
\ngreek_upper_tab<„(\/H“> = char(225) char(188) char(173)
\n* \u00e1\u00bc\u00ae – 225:188:174 = E1 BC AE
\ngreek_upper_tab<„)=H“> = char(225) char(188) char(174)
\n* \u00e1\u00bc\u00af – 225:188:175 = E1 BC AF
\ngreek_upper_tab<„(=H“> = char(225) char(188) char(175)
\n* \u00e1\u00bc\u00b8 – 225:188:184 = E1 BC B8
\ngreek_upper_tab<„)I“> = char(225) char(188) char(184)
\n* \u00e1\u00bc\u00b9 – 225:188:185 = E1 BC B9
\ngreek_upper_tab<„(I“> = char(225) char(188) char(185)
\n* \u00e1\u00bc\u00ba – 225:188:186 = E1 BC BA
\ngreek_upper_tab<„)I“> = char(225) char(188) char(186)
\n* \u00e1\u00bc\u00bb – 225:188:187 = E1 BC BB
\ngreek_upper_tab<„(I“> = char(225) char(188) char(187)
\n* \u00e1\u00bc\u00bc – 225:188:188 = E1 BC BC
\ngreek_upper_tab<„)\/I“> = char(225) char(188) char(188)
\n* \u00e1\u00bc\u00bd – 225:188:189 = E1 BC BD
\ngreek_upper_tab<„(\/I“> = char(225) char(188) char(189)
\n* \u00e1\u00bc\u00be – 225:188:190 = E1 BC BE
\ngreek_upper_tab<„)=I“> = char(225) char(188) char(190)
\n* \u00e1\u00bc\u00bf – 225:188:191 = E1 BC BF
\ngreek_upper_tab<„(=I“> = char(225) char(188) char(191)
\n* \u00e1\u00bd\u02c6 – 225:189:136 = E1 BD 88
\ngreek_upper_tab<„)O“> = char(225) char(189) char(136)
\n* \u00e1\u00bd\u2030 – 225:189:137 = E1 BD 89
\ngreek_upper_tab<„(O“> = char(225) char(189) char(137)
\n* \u00e1\u00bd\u0160 – 225:189:138 = E1 BD 8A
\ngreek_upper_tab<„)O“> = char(225) char(189) char(138)
\n* \u00e1\u00bd\u2039 – 225:189:139 = E1 BD 8B
\ngreek_upper_tab<„(O“> = char(225) char(189) char(139)
\n* \u00e1\u00bd\u0152 – 225:189:140 = E1 BD 8C
\ngreek_upper_tab<„)\/O“> = char(225) char(189) char(140)
\n* \u00e1\u00bd\u008d – 225:189:141 = E1 BD 8D
\ngreek_upper_tab<„(\/O“> = char(225) char(189) char(141)
\n* \u00e1\u00bd\u017d – 225:189:142 = E1 BD 8E
\ngreek_upper_tab<„)=O“> = char(225) char(189) char(142)
\n* \u00e1\u00bd\u008f – 225:189:143 = E1 BD 8F
\ngreek_upper_tab<„(=O“> = char(225) char(189) char(143)
\n* \u00e1\u00bd\u02dc – 225:189:152 = E1 BD 98
\n***
\n*** Diese Form wird von den meisten fonts noch nicht unterstuetzt:
\n***
\n*** greek_upper_tab<„)U“> = char(225) char(189) char(152)
\n***
\n*** Statt dessen verwenden wir ) plus normales Y:
\n***
\ngreek_upper_tab<„)U“> = char(225) char(190) char(191) char(206) char(165)
\n* \u00e1\u00bd\u2122 – 225:189:153 = E1 BD 99
\ngreek_upper_tab<„(U“> = char(225) char(189) char(153)
\n* \u00e1\u00bd\u0161 – 225:189:154 = E1 BD 9A
\ngreek_upper_tab<„)U“> = char(225) char(189) char(154)
\n* \u00e1\u00bd\u203a – 225:189:155 = E1 BD 9B
\ngreek_upper_tab<„(U“> = char(225) char(189) char(155)
\n* \u00e1\u00bd\u0153 – 225:189:156 = E1 BD 9C
\ngreek_upper_tab<„)\/U“> = char(225) char(189) char(156)
\n* \u00e1\u00bd\u009d – 225:189:157 = E1 BD 9D
\ngreek_upper_tab<„(\/U“> = char(225) char(189) char(157)
\n* \u00e1\u00bd\u017e – 225:189:158 = E1 BD 9E
\ngreek_upper_tab<„)=U“> = char(225) char(189) char(158)
\n* \u00e1\u00bd\u0178 – 225:189:159 = E1 BD 9F
\ngreek_upper_tab<„(=U“> = char(225) char(189) char(159)
\n* \u00e1\u00bd\u00a8 – 225:189:168 = E1 BD A8
\ngreek_upper_tab<„)W“> = char(225) char(189) char(168)
\n* \u00e1\u00bd\u00a9 – 225:189:169 = E1 BD A9
\ngreek_upper_tab<„(W“> = char(225) char(189) char(169)
\n* \u00e1\u00bd\u00aa – 225:189:170 = E1 BD AA
\ngreek_upper_tab<„)W“> = char(225) char(189) char(170)
\n* \u00e1\u00bd\u00ab – 225:189:171 = E1 BD AB
\ngreek_upper_tab<„(W“> = char(225) char(189) char(171)
\n* \u00e1\u00bd\u00ac – 225:189:172 = E1 BD AC
\ngreek_upper_tab<„)\/W“> = char(225) char(189) char(172)
\n* \u00e1\u00bd\u00ad – 225:189:173 = E1 BD AD
\ngreek_upper_tab<„(\/W“> = char(225) char(189) char(173)
\n* \u00e1\u00bd\u00ae – 225:189:174 = E1 BD AE
\ngreek_upper_tab<„)=W“> = char(225) char(189) char(174)
\n* \u00e1\u00bd\u00af – 225:189:175 = E1 BD AF
\ngreek_upper_tab<„(=W“> = char(225) char(189) char(175)
\n* \u00e1\u00be\u02c6 – 225:190:136 = E1 BE 88
\ngreek_upper_tab<„)A|“> = char(225) char(190) char(136)
\n* \u00e1\u00be\u2030 – 225:190:137 = E1 BE 89
\ngreek_upper_tab<„(A|“> = char(225) char(190) char(137)
\n* \u00e1\u00be\u0160 – 225:190:138 = E1 BE 8A
\ngreek_upper_tab<„)A|“> = char(225) char(190) char(138)
\n* \u00e1\u00be\u2039 – 225:190:139 = E1 BE 8B
\ngreek_upper_tab<„(A|“> = char(225) char(190) char(139)
\n* \u00e1\u00be\u0152 – 225:190:140 = E1 BE 8C
\ngreek_upper_tab<„)\/A|“> = char(225) char(190) char(140)
\n* \u00e1\u00be\u008d – 225:190:141 = E1 BE 8D
\ngreek_upper_tab<„(\/A|“> = char(225) char(190) char(141)
\n* \u00e1\u00be\u017d – 225:190:142 = E1 BE 8E
\ngreek_upper_tab<„)=A|“> = char(225) char(190) char(142)
\n* \u00e1\u00be\u008f – 225:190:143 = E1 BE 8F
\ngreek_upper_tab<„(=A|“> = char(225) char(190) char(143)
\n* \u00e1\u00be\u02dc – 225:190:152 = E1 BE 98
\ngreek_upper_tab<„)H|“> = char(225) char(190) char(152)
\n* \u00e1\u00be\u2122 – 225:190:153 = E1 BE 99
\ngreek_upper_tab<„(H|“> = char(225) char(190) char(153)
\n* \u00e1\u00be\u0161 – 225:190:154 = E1 BE 9A
\ngreek_upper_tab<„)H|“> = char(225) char(190) char(154)
\n* \u00e1\u00be\u203a – 225:190:155 = E1 BE 9B
\ngreek_upper_tab<„(H|“> = char(225) char(190) char(155)
\n* \u00e1\u00be\u0153 – 225:190:156 = E1 BE 9C
\ngreek_upper_tab<„)\/H|“> = char(225) char(190) char(156)
\n* \u00e1\u00be\u009d – 225:190:157 = E1 BE 9D
\ngreek_upper_tab<„(\/H|“> = char(225) char(190) char(157)
\n* \u00e1\u00be\u017e – 225:190:158 = E1 BE 9E
\ngreek_upper_tab<„)=H|“> = char(225) char(190) char(158)
\n* \u00e1\u00be\u0178 – 225:190:159 = E1 BE 9F
\ngreek_upper_tab<„(=H|“> = char(225) char(190) char(159)
\n* \u00e1\u00be\u00a8 – 225:190:168 = E1 BE A8
\ngreek_upper_tab<„)W|“> = char(225) char(190) char(168)
\n* \u00e1\u00be\u00a9 – 225:190:169 = E1 BE A9
\ngreek_upper_tab<„(W|“> = char(225) char(190) char(169)
\n* \u00e1\u00be\u00aa – 225:190:170 = E1 BE AA
\ngreek_upper_tab<„)W|“> = char(225) char(190) char(170)
\n* \u00e1\u00be\u00ab – 225:190:171 = E1 BE AB
\ngreek_upper_tab<„(W|“> = char(225) char(190) char(171)
\n* \u00e1\u00be\u00ac – 225:190:172 = E1 BE AC
\ngreek_upper_tab<„)\/W|“> = char(225) char(190) char(172)
\n* \u00e1\u00be\u00ad – 225:190:173 = E1 BE AD
\ngreek_upper_tab<„(\/W|“> = char(225) char(190) char(173)
\n* \u00e1\u00be\u00ae – 225:190:174 = E1 BE AE
\ngreek_upper_tab<„)=W|“> = char(225) char(190) char(174)
\n* \u00e1\u00be\u00af – 225:190:175 = E1 BE AF
\ngreek_upper_tab<„(=W|“> = char(225) char(190) char(175)
\n* \u00e1\u00be\u00ba – 225:190:186 = E1 BE BA
\ngreek_upper_tab<„A“> = char(225) char(190) char(186)
\n* \u00e1\u00be\u00bb – 225:190:187 = E1 BE BB
\ngreek_upper_tab<„\/A“> = char(225) char(190) char(187)
\n* \u00e1\u00be\u00bc – 225:190:188 = E1 BE BC
\ngreek_upper_tab<„A|“> = char(225) char(190) char(188)
\n* \u00e1\u00bf\u02c6 – 225:191:136 = E1 BF 88
\ngreek_upper_tab<„E“> = char(225) char(191) char(136)
\n* \u00e1\u00bf\u2030 – 225:191:137 = E1 BF 89
\ngreek_upper_tab<„\/E“> = char(225) char(191) char(137)
\n* \u00e1\u00bf\u0160 – 225:191:138 = E1 BF 8A
\ngreek_upper_tab<„H“> = char(225) char(191) char(138)
\n* \u00e1\u00bf\u2039 – 225:191:139 = E1 BF 8B
\ngreek_upper_tab<„\/H“> = char(225) char(191) char(139)
\n* \u00e1\u00bf\u0152 – 225:191:140 = E1 BF 8C gross
\ngreek_upper_tab<„H|“> = char(225) char(191) char(140)
\n* \u00e1\u00bf\u0161 – 225:191:154 = E1 BF 9A
\ngreek_upper_tab<„I“> = char(225) char(191) char(154)
\n* \u00e1\u00bf\u203a – 225:191:155 = E1 BF 9B
\ngreek_upper_tab<„\/I“> = char(225) char(191) char(155)
\n* \u00e1\u00bf\u00aa – 225:191:170 = E1 BF AA
\ngreek_upper_tab<„U“> = char(225) char(191) char(170)
\n* \u00e1\u00bf\u00ab – 225:191:171 = E1 BF AB
\ngreek_upper_tab<„\/U“> = char(225) char(191) char(171)
\n* \u00e1\u00bf\u00ac – 225:191:172 = E1 BF AC
\ngreek_upper_tab<„(R“> = char(225) char(191) char(172)
\n* \u00e1\u00bf\u00b8 – 225:191:184 = E1 BF B8
\ngreek_upper_tab<„O“> = char(225) char(191) char(184)
\n* \u00e1\u00bf\u00b9 – 225:191:185 = E1 BF B9
\ngreek_upper_tab<„\/O“> = char(225) char(191) char(185)
\n* \u00e1\u00bf\u00ba – 225:191:186 = E1 BF BA
\ngreek_upper_tab<„W“> = char(225) char(191) char(186)
\n* \u00e1\u00bf\u00bb – 225:191:187 = E1 BF BB
\ngreek_upper_tab<„\/W“> = char(225) char(191) char(187)
\n* \u00e1\u00bf\u00bc – 225:191:188 = E1 BF BC
\ngreek_upper_tab<„W|“> = char(225) char(191) char(188)
\n* alpha iota sub \u00e1\u00be\u00bc
\ngreek_upper_tab<„A|“> = char(225) char(190) char(188)
\n* upsilon and dihaeresis \u00ce\u00ab
\ngreek_upper_tab<„U+“> = char(206) char(171)
\n* iota dihaeresis \u00ce\u00aa
\ngreek_upper_tab<„I+“> = char(206) char(170)
\n* spiritus lenis: \u00e1\u00bf\u00be
\ngreek_upper_tab<„)“> = char(225) char(191) char(190)
\n* digamma capital: \u00cf\u0153
\ngreek_upper_tab<„V“> = char(207) char(156)
\n*
\n*
\n*******************************************************************************
\n* *
\n* *
\n* Lower Greek table: *
\n* *
\n* *
\n*******************************************************************************
\n*
\n* „\u00ce\u00b1“ – 206:177 = CE B1
\ngreek_lower_tab<„A“> = char(206) char(177)
\n* „\u00ce\u00b2“ – 206:178 = CE B2
\ngreek_lower_tab<„B“> = char(206) char(178)
\n* „\u00ce\u00b3“ – 206:179 = CE B3
\ngreek_lower_tab<„G“> = char(206) char(179)
\n* „\u00ce\u00b4“ – 206:180 = CE B4
\ngreek_lower_tab<„D“> = char(206) char(180)
\n* „\u00ce\u00b4'“ – 206:180 = CE B4 27 erroneous d‘, present in some texts on the TLG CD E
\ngreek_lower_tab<„D\/“> = char(206) char(180) char(39)
\n* „\u00ce\u00b5“ – 206:181 = CE B5
\ngreek_lower_tab<„E“> = char(206) char(181)
\n* „\u00ce\u00b6“ – 206:182 = CE B6
\ngreek_lower_tab<„Z“> = char(206) char(182)
\n* „\u00ce\u00b7“ – 206:183 = CE B7
\ngreek_lower_tab<„H“> = char(206) char(183)
\n* „\u00ce\u00b8“ – 206:184 = CE B8
\ngreek_lower_tab<„Q“> = char(206) char(184)
\n* „\u00ce\u00b9“ – 206:185 = CE B9
\ngreek_lower_tab<„I“> = char(206) char(185)
\n* Attic aspiration:
\ngreek_lower_tab<„J“> = „h“
\n* „\u00ce\u00ba“ – 206:186 = CE BA
\ngreek_lower_tab<„K“> = char(206) char(186)
\n* „\u00ce\u00bb“ – 206:187 = CE BB
\ngreek_lower_tab<„L“> = char(206) char(187)
\n* „\u00ce\u00bc“ – 206:188 = CE BC
\ngreek_lower_tab<„M“> = char(206) char(188)
\n* „\u00ce\u00bd“ – 206:189 = CE BD
\ngreek_lower_tab<„N“> = char(206) char(189)
\n* „\u00ce\u00be“ – 206:190 = CE BE
\ngreek_lower_tab<„C“> = char(206) char(190)
\n* „\u00ce\u00bf“ – 206:191 = CE BF
\ngreek_lower_tab<„O“> = char(206) char(191)
\n* „\u00cf\u20ac“ – 207:128 = CF 80
\ngreek_lower_tab<„P“> = char(207) char(128)
\n* „\u00cf\u0081“ – 207:129 = CF 81
\ngreek_lower_tab<„R“> = char(207) char(129)
\n* „\u00cf\u201a“ – 207:130 = CF 82 – final sigma
\ngreek_lower_tab<„\u00e4“> = char(207) char(130)
\n* „\u00cf\u0192“ – 207:131 = CF 83
\ngreek_lower_tab<„S“> = char(207) char(131)
\n* „\u00cf\u201e“ – 207:132 = CF 84
\ngreek_lower_tab<„T“> = char(207) char(132)
\n* „\u00cf\u2026“ – 207:133 = CF 85
\ngreek_lower_tab<„U“> = char(207) char(133)
\n* „\u00cf\u2020“ – 207:134 = CF 86
\ngreek_lower_tab<„F“> = char(207) char(134)
\n* „\u00cf\u2021“ – 207:135 = CF 87
\ngreek_lower_tab<„X“> = char(207) char(135)
\n* „\u00cf\u02c6“ – 207:136 = CF 88
\ngreek_lower_tab<„Y“> = char(207) char(136)
\n* „\u00cf\u2030“ – 207:137 = CF 89
\ngreek_lower_tab<„W“> = char(207) char(137)
\n* „\u00ce\u00ac“ – 206:172 = CE AC
\ngreek_lower_tab<„A\/“> = char(206) char(172)
\n* „\u00ce\u00ad“ – 206:173 = CE AD
\n*** greek_lower_tab<„E\/“> = char(206) char(173)
\n* „\u00ce\u00ae“ – 206:174 = CE AE
\n*** greek_lower_tab<„H\/“> = char(206) char(174)
\n* „\u00ce\u00af“ – 206:175 = CE AF
\n*** greek_lower_tab<„I\/“> = char(206) char(175)
\n* „\u00cf\u0152“ – 207:140 = CF 8C
\n*** greek_lower_tab<„O\/“> = char(207) char(140)
\n* „\u00cf\u008d“ – 207:141 = CF 8D
\n*** greek_lower_tab<„U\/“> = char(207) char(141)
\n* „\u00cf\u017d“ – 207:142 = CF 8E
\n*** greek_lower_tab<„W\/“> = char(207) char(142)
\n* \u00e1\u00bc\u20ac – 225:188:128 = E1 BC 80
\ngreek_lower_tab<„A)“> = char(225) char(188) char(128)
\n* \u00e1\u00bc\u0081 – 225:188:129 = E1 BC 81
\ngreek_lower_tab<„A(„> = char(225) char(188) char(129)
\n* \u00e1\u00bc\u201a – 225:188:130 = E1 BC 82
\ngreek_lower_tab<„A)“> = char(225) char(188) char(130)
\n* \u00e1\u00bc\u0192 – 225:188:131 = E1 BC 83
\ngreek_lower_tab<„A(„> = char(225) char(188) char(131)
\n* \u00e1\u00bc\u201e – 225:188:132 = E1 BC 84
\ngreek_lower_tab<„A)\/“> = char(225) char(188) char(132)
\n* \u00e1\u00bc\u2026 – 225:188:133 = E1 BC 85
\ngreek_lower_tab<„A(\/“> = char(225) char(188) char(133)
\n* \u00e1\u00bc\u2020 – 225:188:134 = E1 BC 86
\ngreek_lower_tab<„A)=“> = char(225) char(188) char(134)
\n* \u00e1\u00bc\u2021 – 225:188:135 = E1 BC 87
\ngreek_lower_tab<„A(=“> = char(225) char(188) char(135)
\n* \u00e1\u00bc\u0090 – 225:188:144 = E1 BC 90
\ngreek_lower_tab<„E)“> = char(225) char(188) char(144)
\n* \u00e1\u00bc\u2018 – 225:188:145 = E1 BC 91
\ngreek_lower_tab<„E(„> = char(225) char(188) char(145)
\n* \u00e1\u00bc\u2019 – 225:188:146 = E1 BC 92
\ngreek_lower_tab<„E)“> = char(225) char(188) char(146)
\ngreek_lower_tab<„E)“> = char(225) char(188) char(146)
\n* \u00e1\u00bc\u201c – 225:188:147 = E1 BC 93
\ngreek_lower_tab<„E(„> = char(225) char(188) char(147)
\ngreek_lower_tab<„E(„> = char(225) char(188) char(147)
\n* \u00e1\u00bc\u201d – 225:188:148 = E1 BC 94
\ngreek_lower_tab<„E)\/“> = char(225) char(188) char(148)
\ngreek_lower_tab<„E\/)“> = char(225) char(188) char(148)
\n* \u00e1\u00bc\u2022 – 225:188:149 = E1 BC 95
\ngreek_lower_tab<„E(\/“> = char(225) char(188) char(149)
\ngreek_lower_tab<„E\/(„> = char(225) char(188) char(149)
\n* \u00e1\u00bc\u00a0 – 225:188:160 = E1 BC A0
\ngreek_lower_tab<„H)“> = char(225) char(188) char(160)
\n* \u00e1\u00bc\u00a1 – 225:188:161 = E1 BC A1
\ngreek_lower_tab<„H(„> = char(225) char(188) char(161)
\n* \u00e1\u00bc\u00a2 – 225:188:162 = E1 BC A2
\ngreek_lower_tab<„H)“> = char(225) char(188) char(162)
\n* \u00e1\u00bc\u00a3 – 225:188:163 = E1 BC A3
\ngreek_lower_tab<„H(„> = char(225) char(188) char(163)
\n* \u00e1\u00bc\u00a4 – 225:188:164 = E1 BC A4
\ngreek_lower_tab<„H)\/“> = char(225) char(188) char(164)
\n* \u00e1\u00bc\u00a5 – 225:188:165 = E1 BC A5
\ngreek_lower_tab<„H(\/“> = char(225) char(188) char(165)
\n* \u00e1\u00bc\u00a6 – 225:188:166 = E1 BC A6
\ngreek_lower_tab<„H)=“> = char(225) char(188) char(166)
\ngreek_lower_tab<„H=)“> = char(225) char(188) char(166)
\n* \u00e1\u00bc\u00a7 – 225:188:167 = E1 BC A7
\ngreek_lower_tab<„H(=“> = char(225) char(188) char(167)
\ngreek_lower_tab<„H=(„> = char(225) char(188) char(167)
\n* \u00e1\u00bc\u00b0 – 225:188:176 = E1 BC B0
\ngreek_lower_tab<„I)“> = char(225) char(188) char(176)
\n* \u00e1\u00bc\u00b1 – 225:188:177 = E1 BC B1
\ngreek_lower_tab<„I(„> = char(225) char(188) char(177)
\n* \u00e1\u00bc\u00b2 – 225:188:178 = E1 BC B2
\ngreek_lower_tab<„I)“> = char(225) char(188) char(178)
\ngreek_lower_tab<„I)“> = char(225) char(188) char(178)
\n* \u00e1\u00bc\u00b3 – 225:188:179 = E1 BC B3
\ngreek_lower_tab<„I(„> = char(225) char(188) char(179)
\ngreek_lower_tab<„I(„> = char(225) char(188) char(179)
\n* \u00e1\u00bc\u00b4 – 225:188:180 = E1 BC B4
\ngreek_lower_tab<„I)\/“> = char(225) char(188) char(180)
\ngreek_lower_tab<„I\/)“> = char(225) char(188) char(180)
\n* \u00e1\u00bc\u00b5 – 225:188:181 = E1 BC B5
\ngreek_lower_tab<„I(\/“> = char(225) char(188) char(181)
\ngreek_lower_tab<„I\/(„> = char(225) char(188) char(181)
\n* \u00e1\u00bc\u00b6 – 225:188:182 = E1 BC B6
\ngreek_lower_tab<„I)=“> = char(225) char(188) char(182)
\ngreek_lower_tab<„I=)“> = char(225) char(188) char(182)
\n* \u00e1\u00bc\u00b7 – 225:188:183 = E1 BC B7
\ngreek_lower_tab<„I(=“> = char(225) char(188) char(183)
\ngreek_lower_tab<„I=(„> = char(225) char(188) char(183)
\n* \u00e1\u00bd\u20ac – 225:189:128 = E1 BD 80
\ngreek_lower_tab<„O)“> = char(225) char(189) char(128)
\n* \u00e1\u00bd\u0081 – 225:189:129 = E1 BD 81
\ngreek_lower_tab<„O(„> = char(225) char(189) char(129)
\n* \u00e1\u00bd\u201a – 225:189:130 = E1 BD 82
\ngreek_lower_tab<„O)“> = char(225) char(189) char(130)
\ngreek_lower_tab<„O)“> = char(225) char(189) char(130)
\n* \u00e1\u00bd\u0192 – 225:189:131 = E1 BD 83
\ngreek_lower_tab<„O(„> = char(225) char(189) char(131)
\ngreek_lower_tab<„O(„> = char(225) char(189) char(131)
\n* \u00e1\u00bd\u201e – 225:189:132 = E1 BD 84
\ngreek_lower_tab<„O)\/“> = char(225) char(189) char(132)
\ngreek_lower_tab<„O\/)“> = char(225) char(189) char(132)
\n* \u00e1\u00bd\u2026 – 225:189:133 = E1 BD 85
\ngreek_lower_tab<„O(\/“> = char(225) char(189) char(133)
\ngreek_lower_tab<„O\/(„> = char(225) char(189) char(133)
\n* \u00e1\u00bd\u2020 – 225:189:134 = E1 BD 86
\ngreek_lower_tab<„O)=“> = char(225) char(189) char(128) char(204) char(145)
\ngreek_lower_tab<„O=)“> = char(225) char(189) char(128) char(204) char(145)
\n* \u00e1\u00bd\u2021 – 225:189:135 = E1 BD 87
\ngreek_lower_tab<„O(=“> = char(225) char(189) char(129) char(204) char(145)
\ngreek_lower_tab<„O=(„> = char(225) char(189) char(129) char(204) char(145)
\n* \u00e1\u00bd\u0090 – 225:189:144 = E1 BD 90
\ngreek_lower_tab<„U)“> = char(225) char(189) char(144)
\n* \u00e1\u00bd\u2018 – 225:189:145 = E1 BD 91
\ngreek_lower_tab<„U(„> = char(225) char(189) char(145)
\n* \u00e1\u00bd\u2019 – 225:189:146 = E1 BD 92
\ngreek_lower_tab<„U)“> = char(225) char(189) char(146)
\ngreek_lower_tab<„U)“> = char(225) char(189) char(146)
\n* \u00e1\u00bd\u201c – 225:189:147 = E1 BD 93
\ngreek_lower_tab<„U(„> = char(225) char(189) char(147)
\ngreek_lower_tab<„U(„> = char(225) char(189) char(147)
\n* \u00e1\u00bd\u201d – 225:189:148 = E1 BD 94
\ngreek_lower_tab<„U)\/“> = char(225) char(189) char(148)
\ngreek_lower_tab<„U\/)“> = char(225) char(189) char(148)
\n* \u00e1\u00bd\u2022 – 225:189:149 = E1 BD 95
\ngreek_lower_tab<„U(\/“> = char(225) char(189) char(149)
\ngreek_lower_tab<„U\/(„> = char(225) char(189) char(149)
\n* \u00e1\u00bd\u2013 – 225:189:150 = E1 BD 96
\ngreek_lower_tab<„U)=“> = char(225) char(189) char(150)
\ngreek_lower_tab<„U=)“> = char(225) char(189) char(150)
\n* \u00e1\u00bd\u2014 – 225:189:151 = E1 BD 97
\ngreek_lower_tab<„U(=“> = char(225) char(189) char(151)
\ngreek_lower_tab<„U=(„> = char(225) char(189) char(151)
\n* \u00e1\u00bd\u00a0 – 225:189:160 = E1 BD A0
\ngreek_lower_tab<„W)“> = char(225) char(189) char(160)
\n* \u00e1\u00bd\u00a1 – 225:189:161 = E1 BD A1
\ngreek_lower_tab<„W(„> = char(225) char(189) char(161)
\n* \u00e1\u00bd\u00a2 – 225:189:162 = E1 BD A2
\ngreek_lower_tab<„W)“> = char(225) char(189) char(162)
\ngreek_lower_tab<„W)“> = char(225) char(189) char(162)
\n* \u00e1\u00bd\u00a3 – 225:189:163 = E1 BD A3
\ngreek_lower_tab<„W(„> = char(225) char(189) char(163)
\ngreek_lower_tab<„W(„> = char(225) char(189) char(163)
\n* \u00e1\u00bd\u00a4 – 225:189:164 = E1 BD A4
\ngreek_lower_tab<„W)\/“> = char(225) char(189) char(164)
\ngreek_lower_tab<„W\/)“> = char(225) char(189) char(164)
\n* \u00e1\u00bd\u00a5 – 225:189:165 = E1 BD A5
\ngreek_lower_tab<„W(\/“> = char(225) char(189) char(165)
\ngreek_lower_tab<„W\/(„> = char(225) char(189) char(165)
\n* \u00e1\u00bd\u00a6 – 225:189:166 = E1 BD A6
\ngreek_lower_tab<„W)=“> = char(225) char(189) char(166)
\ngreek_lower_tab<„W=)“> = char(225) char(189) char(166)
\n* \u00e1\u00bd\u00a7 – 225:189:167 = E1 BD A7
\ngreek_lower_tab<„W(=“> = char(225) char(189) char(167)
\ngreek_lower_tab<„W=(„> = char(225) char(189) char(167)
\n* \u00e1\u00bd\u00b1 – 225:189:177 = E1 BD B1
\ngreek_lower_tab<„A\/“> = char(225) char(189) char(177)
\n* \u00e1\u00bd\u00b2 – 225:189:178 = E1 BD B2
\ngreek_lower_tab<„E“> = char(225) char(189) char(178)
\n* \u00e1\u00bd\u00b3 – 225:189:179 = E1 BD B3
\ngreek_lower_tab<„E\/“> = char(225) char(189) char(179)
\n* \u00e1\u00bd\u00b4 – 225:189:180 = E1 BD B4
\ngreek_lower_tab<„H“> = char(225) char(189) char(180)
\n* \u00e1\u00bd\u00b5 – 225:189:181 = E1 BD B5
\ngreek_lower_tab<„H\/“> = char(225) char(189) char(181)
\n* \u00e1\u00bd\u00b6 – 225:189:182 = E1 BD B6
\ngreek_lower_tab<„I“> = char(225) char(189) char(182)
\n* \u00e1\u00bd\u00b7 – 225:189:183 = E1 BD B7
\ngreek_lower_tab<„I\/“> = char(225) char(189) char(183)
\n* \u00e1\u00bd\u00b8 – 225:189:184 = E1 BD B8
\ngreek_lower_tab<„O“> = char(225) char(189) char(184)
\n* \u00e1\u00bd\u00b9 – 225:189:185 = E1 BD B9
\ngreek_lower_tab<„O\/“> = char(225) char(189) char(185)
\n* \u00e1\u00bd\u00ba – 225:189:186 = E1 BD BA
\ngreek_lower_tab<„U“> = char(225) char(189) char(186)
\n* \u00e1\u00bd\u00bb – 225:189:187 = E1 BD BB
\ngreek_lower_tab<„U\/“> = char(225) char(189) char(187)
\n* \u00e1\u00bd\u00bc – 225:189:188 = E1 BD BC
\ngreek_lower_tab<„W“> = char(225) char(189) char(188)
\n* \u00e1\u00bd\u00bd – 225:189:189 = E1 BD BD
\ngreek_lower_tab<„W\/“> = char(225) char(189) char(189)
\n* \u00e1\u00be\u20ac – 225:190:128 = E1 BE 80
\ngreek_lower_tab<„A)|“> = char(225) char(190) char(128)
\n* \u00e1\u00be\u0081 – 225:190:129 = E1 BE 81
\ngreek_lower_tab<„A(|“> = char(225) char(190) char(129)
\n* \u00e1\u00be\u201a – 225:190:130 = E1 BE 82
\ngreek_lower_tab<„A)|“> = char(225) char(190) char(130)
\n* \u00e1\u00be\u0192 – 225:190:131 = E1 BE 83
\ngreek_lower_tab<„A(|“> = char(225) char(190) char(131)
\n* \u00e1\u00be\u201e – 225:190:132 = E1 BE 84
\ngreek_lower_tab<„A)|“> = char(225) char(190) char(132)
\n* \u00e1\u00be\u2026 – 225:190:133 = E1 BE 85
\ngreek_lower_tab<„A(\/|“> = char(225) char(190) char(133)
\n* \u00e1\u00be\u2020 – 225:190:134 = E1 BE 86
\ngreek_lower_tab<„A)=|“> = char(225) char(190) char(134)
\n* \u00e1\u00be\u2021 – 225:190:135 = E1 BE 87
\ngreek_lower_tab<„A(=|“> = char(225) char(190) char(135)
\n* \u00e1\u00be\u0090 – 225:190:144 = E1 BE 90
\ngreek_lower_tab<„H)|“> = char(225) char(190) char(144)
\n* \u00e1\u00be\u2018 – 225:190:145 = E1 BE 91
\ngreek_lower_tab<„H(|“> = char(225) char(190) char(145)
\n* \u00e1\u00be\u2019 – 225:190:146 = E1 BE 92
\ngreek_lower_tab<„H)|“> = char(225) char(190) char(146)
\n* \u00e1\u00be\u201c – 225:190:147 = E1 BE 93
\ngreek_lower_tab<„H(|“> = char(225) char(190) char(147)
\n* \u00e1\u00be\u201d – 225:190:148 = E1 BE 94
\ngreek_lower_tab<„H)\/|“> = char(225) char(190) char(148)
\n* \u00e1\u00be\u2022 – 225:190:149 = E1 BE 95
\ngreek_lower_tab<„H(\/|“> = char(225) char(190) char(149)
\n* \u00e1\u00be\u2013 – 225:190:150 = E1 BE 96
\ngreek_lower_tab<„H)=|“> = char(225) char(190) char(150)
\ngreek_lower_tab<„H=)|“> = char(225) char(190) char(150)
\n* \u00e1\u00be\u2014 – 225:190:151 = E1 BE 97
\ngreek_lower_tab<„H(=|“> = char(225) char(190) char(151)
\ngreek_lower_tab<„H=(|“> = char(225) char(190) char(151)
\n* \u00e1\u00be\u00a0 – 225:190:160 = E1 BE A0
\ngreek_lower_tab<„W)|“> = char(225) char(190) char(160)
\n* \u00e1\u00be\u00a1 – 225:190:161 = E1 BE A1
\ngreek_lower_tab<„W(|“> = char(225) char(190) char(161)
\n* \u00e1\u00be\u00a2 – 225:190:162 = E1 BE A2
\ngreek_lower_tab<„W)|“> = char(225) char(190) char(162)
\n* \u00e1\u00be\u00a3 – 225:190:163 = E1 BE A3
\ngreek_lower_tab<„W(|“> = char(225) char(190) char(163)
\n* \u00e1\u00be\u00a4 – 225:190:164 = E1 BE A4
\ngreek_lower_tab<„W)\/|“> = char(225) char(190) char(164)
\n* \u00e1\u00be\u00a5 – 225:190:165 = E1 BE A5
\ngreek_lower_tab<„W(\/|“> = char(225) char(190) char(165)
\n* \u00e1\u00be\u00a6 – 225:190:166 = E1 BE A6
\ngreek_lower_tab<„W)=|“> = char(225) char(190) char(166)
\n* \u00e1\u00be\u00a7 – 225:190:167 = E1 BE A7
\ngreek_lower_tab<„W(=|“> = char(225) char(190) char(167)
\n* \u00e1\u00be\u00b2 – 225:190:178 = E1 BE B2
\ngreek_lower_tab<„A|“> = char(225) char(190) char(178)
\n* \u00e1\u00bd\u00b0 – 225:189:176 = E1 BD B0
\ngreek_lower_tab<„A“> = char(225) char(189) char(176)
\n* \u00e1\u00be\u00b4 – 225:190:180 = E1 BE B4
\ngreek_lower_tab<„A\/“> = char(225) char(190) char(180)
\n* \u00e1\u00be\u00b6 – 225:190:182 = E1 BE B6
\ngreek_lower_tab<„A=“> = char(225) char(190) char(182)
\n* \u00e1\u00be\u00b7 – 225:190:183 = E1 BE B7
\ngreek_lower_tab<„A=|“> = char(225) char(190) char(183)
\n* \u00e1\u00bf\u201a – 225:191:130 = E1 BF 82
\ngreek_lower_tab<„H|“> = char(225) char(191) char(130)
\n* \u00e1\u00bf\u0192 – 225:191:131 = E1 BF 83
\ngreek_lower_tab<„H|“> = char(225) char(191) char(131)
\n* \u00e1\u00bf\u201e – 225:191:132 = E1 BF 84
\ngreek_lower_tab<„H\/|“> = char(225) char(191) char(132)
\n* \u00e1\u00bf\u2020 – 225:191:134 = E1 BF 86
\ngreek_lower_tab<„H=“> = char(225) char(191) char(134)
\n* \u00e1\u00bf\u2021 – 225:191:135 = E1 BF 87
\ngreek_lower_tab<„H=|“> = char(225) char(191) char(135)
\n* \u00e1\u00bf\u2019 – 225:191:146 = E1 BF 92
\ngreek_lower_tab<„I+“> = char(225) char(191) char(146)
\n* \u00e1\u00bf\u201c – 225:191:147 = E1 BF 93
\ngreek_lower_tab<„I\/+“> = char(225) char(191) char(147)
\n* \u00e1\u00bf\u2013 – 225:191:150 = E1 BF 96
\ngreek_lower_tab<„I=“> = char(225) char(191) char(150)
\n* \u00e1\u00bf\u2014 – 225:191:151 = E1 BF 97
\ngreek_lower_tab<„I=+“> = char(225) char(191) char(151)
\n* \u00e1\u00bf\u00a2 – 225:191:162 = E1 BF A2
\ngreek_lower_tab<„U+“> = char(225) char(191) char(162)
\n* \u00e1\u00bf\u00a3 – 225:191:163 = E1 BF A3
\ngreek_lower_tab<„U\/+“> = char(225) char(191) char(163)
\n* \u00e1\u00bf\u00a4 – 225:191:164 = E1 BF A4
\ngreek_lower_tab<„R)“> = char(225) char(191) char(164)
\n* \u00e1\u00bf\u00a5 – 225:191:165 = E1 BF A5
\ngreek_lower_tab<„R(„> = char(225) char(191) char(165)
\n* \u00e1\u00bf\u00a6 – 225:191:166 = E1 BF A6
\ngreek_lower_tab<„U=“> = char(225) char(191) char(166)
\n* \u00e1\u00bf\u00a7 – 225:191:167 = E1 BF A7
\ngreek_lower_tab<„U=+“> = char(225) char(191) char(167)
\n* \u00e1\u00bf\u00b2 – 225:191:178 = E1 BF B2
\ngreek_lower_tab<„W|“> = char(225) char(191) char(178)
\n* \u00e1\u00bf\u00b3 – 225:191:179 = E1 BF B3
\ngreek_lower_tab<„W|“> = char(225) char(191) char(179)
\n* \u00e1\u00bf\u00b4 – 225:191:180 = E1 BF B4
\ngreek_lower_tab<„W\/|“> = char(225) char(191) char(180)
\n* \u00e1\u00bf\u00b6 – 225:191:182 = E1 BF B6
\ngreek_lower_tab<„W=“> = char(225) char(191) char(182)
\n* \u00e1\u00bf\u00b7 – 225:191:183 = E1 BF B7
\ngreek_lower_tab<„W=|“> = char(225) char(191) char(183)
\n* This is a variant which ocurs in some of the files, although it should be regarded
\n* as an error:
\ngreek_lower_tab<„W|=“> = char(225) char(191) char(183)
\n* alpha and iota sub: \u00e1\u00be\u00b3 225:190:179 E1 BE B3
\ngreek_lower_tab<„A|“> = char(225) char(190) char(179)
\n* alpha and iota sub: \u00e1\u00be\u00b4
\ngreek_lower_tab<„A\/|“> = char(225) char(190) char(180)
\n* There were several errors with U+ here and in the upercase table, B.M. July 2009
\n* upsilon and dihaeresis \u00cf\u2039
\ngreek_lower_tab<„U+“> = char(207) char(139)
\n* iota and dihaeresis \u00cf\u0160
\ngreek_lower_tab<„I+“> = char(207) char(138)
\n* eta and dihaeresis \u00ce\u00b7\u00cc\u02c6
\ngreek_lower_tab<„H+“> = char(206) char(183) char(204) char(136)
\n* omikron and dihaeresis \u00ce\u00bf\u00cc\u02c6
\ngreek_lower_tab<„O+“> = char(206) char(191) char(204) char(136)
\n* O\/+ \u00cf\u0152\u00cc\u02c6
\ngreek_lower_tab<„O+\/“> = char(207) char(140) char(204) char(136)
\ngreek_lower_tab<„O\/+“> = char(207) char(140) char(204) char(136)
\n* alpha, akzent, spiritus and iota: \u00e1\u00be\u201e
\ngreek_lower_tab<„A)\/|“> = char(225) char(190) char(132)
\n* ommikron and circumflex: \u00ce\u00bf\u00cc\u2018
\ngreek_lower_tab<„O=“> = char(206) char(191) char(204) char(145)
\n* epsilon and circumflex: \u00ce\u00b5\u00cc\u2018
\ngreek_lower_tab<„E=“> = char(206) char(181) char(204) char(145)
\n* epsilon and circumflex: \u00e1\u00bc\u2018\u00cc\u201c
\ngreek_lower_tab<„E(=“> = char(225) char(188) char(145) char(204) char(147)
\n* epsilon and circumflex: \u00e1\u00bc\u0090\u00cc\u201c
\ngreek_lower_tab<„E)=“> = char(225) char(188) char(144) char(204) char(147)
\n* digamma lower: f
\ngreek_lower_tab<„V“> = char(207) char(157)
\n* Variant sigmas:
\n* \u00e4 = final sigma
\n* \u00e4 see above (already defined)
\n* \u00fc = medial sigma
\n*
\ngreek_lower_tab<„\u00fc“> = char(207) char(131)
\n*
\n* \u00f6 = lunate sigma
\n*
\ngreek_lower_tab<„\u00f6“> = char(207) char(178)
\n*
\n* Table for explicit sigma shape conversion:
\n*
\nsigmas = table()
\nsigmas<„1“> = „\u00fc“
\nsigmas<„2“> = „\u00e4“
\nsigmas<„3“> = „\u00f6“
\n*
\n* Table for various diacritical signs in Greek and Latin:
\n*
\ndiacritics = table()
\ndiacritics<„+“> = char(204) char(136)
\ndiacritics<„“> = char(204) char(128)
\ndiacritics<„\/“> = char(204) char(129)
\ndiacritics<„=“> = char(204) char(130)
\n*
\n*
\n*******************************************************************************
\n*
\n* Define functions for later use. The main function to translate
\n* a string from beta code to utf8 is beta_convert(string)
\n* This function is a rather lengthy construct which uses the aforementioned
\n* eating-up algorithm.
\n*
\n* In SNOBOL4 functions must be DEFINEd, and the defining statement must be passed,
\n* so we use labels to „pass around“ the function body. This is unnecessary in most
\n* algorithmic languages
\n* b1-b5 and s1-s5 are local temporary variables which have to be declared here
\n*
\n* Our main translating function will consist of a really huge „switch“ kind of
\n* construction. In SNOBOL4, this is most easily implemented using the indirect
\n* goto. An indirect goto consists of a string, addressed as a label. Effectively,
\n* this is the same as the switch in C:
\n*
\n*******************************************************************************
\n*<\/p>\n

define(„beta_convert(string)b1,b2,b3,b4,s1,s2,s3,uppercase“) :(beta_convert_end)
\nbeta_convert
\n+ string pos(0) len(1) . b1 = :f(return)
\n*
\n*
\n* If b1 is one of markers („#@<>[]{}%$&* and the like)
\n* proceed to special section
\n* Trick: We change „;“ to „:“ , because „;“ can not be used in labels in SNOBOL4!
\n*
\nb1 = ident(b1,“;“) „:“
\nb1 any(markers) :s($(„be_co_“ b1))
\n*
\n* If b1 is one of the lower case alphabetic letters, we know we are in
\n* Latin script and do not have upper case; jump as appropriate:
\n*
\nb1 any(&lcase) :s($(„be_al_“ b1))
\n* Check similarly, if uppercase letter:
\nb1 any(&ucase) :s($(„be_au_“ b1))
\n* Check if space:
\nident(b1,space) :s(be_space)
\n*
\n* No special sign, no lowercase letter, neither uppercase, nor space:
\n* We do not know what it is and put it out unconverted:
\nbeta_convert = beta_convert b1
\nb1 = :(beta_convert)
\n*
\n* Older error routine for production process:
\n*
\n* terminal = „Unidentified symbol in line “ line_counter
\n* terminal = line
\n* terminal = b1 :(beta_convert)
\nbe_space
\n+ beta_convert = beta_convert char(32)
\nb1 = :(beta_convert)
\n*
\n* Special care must be taken for final s:
\n*
\n* We check if explicit sigma shape:
\n*
\nbe_au_S
\n+ ident(actual_language,language_greek) :f(be_au_S_end)
\nstring pos(0) any(„123“) . b2 = :f(be_au_S_norm)
\nb1 = sigmas<b2> :(be_au_S_end)
\nbe_au_S_norm
\n+ b1 =
\n+ ?(string ? pos(0) (span(final_sigma_continue) | „“)
\n+ (any(final_sigma_stop) | rpos(0)))
\n+ „\u00e4“
\nbe_au_S_end
\n*
\n* Old version:
\n*
\n*+ b1 = (ident(actual_language,language_greek))
\n*+ ?(string ? pos(0) (span(final_sigma_continue) | „“) notany(&ucase))
\n*+ „\u00e4“
\nbe_au_A
\nbe_au_E
\nbe_au_H
\nbe_au_I
\nbe_au_O
\nbe_au_U
\nbe_au_W
\nbe_au_R
\nbe_au_B
\nbe_au_C
\nbe_au_D
\nbe_au_F
\nbe_au_G
\nbe_au_J
\nbe_au_K
\nbe_au_L
\nbe_au_M
\nbe_au_N
\nbe_au_P
\nbe_au_Q
\nbe_au_T
\nbe_au_V
\nbe_au_X
\nbe_au_Y
\nbe_au_Z
\n+ beta_convert = ident(actual_language,language_latin)
\n+ beta_convert b1 :s(beta_convert)
\n*
\n* We are in Greek language: Get accents, if Greek language; error otherwise:
\n*
\nterminal = differ(actual_language,language_greek)
\n+ „*** Unknown language in line “ line_counter :s(beta_convert)
\ns2 =
\nstring pos(0) span(beta_greek_accents) . s2 =
\ns3 = greek_lower_tab<b1 s2>
\nbeta_convert = differ(s3) beta_convert s3 :s(be_au_ret)
\nterminal = „*** Unknown letter-accent combination ‚“ b1 s2 „‚ in line “ line_counter
\nterminal = line
\n*
\nbeta_convert = beta_convert b1 s2
\nbe_au_ret
\n+ b1 = ; b2 = ; s1 = ; s2 = ; s3 = :(beta_convert)<\/p>\n

be_al_a
\nbe_al_e
\nbe_al_i
\nbe_al_o
\nbe_al_u
\nbe_al_r<\/p>\n

be_al_b
\nbe_al_c
\nbe_al_d
\nbe_al_f
\nbe_al_g
\nbe_al_h
\nbe_al_j
\nbe_al_k
\nbe_al_l
\nbe_al_m
\nbe_al_n
\nbe_al_p
\nbe_al_q
\nbe_al_s
\nbe_al_t
\nbe_al_v
\nbe_al_w
\nbe_al_x
\nbe_al_y
\nbe_al_z
\n+ beta_convert = ident(actual_language,language_latin)
\n+ beta_convert b1 :s(beta_convert)
\nterminal = „*** Warning: lower case in language “ actual_language “ line “
\n+ line_counter „: “ b1
\nbeta_convert = beta_convert b1 :(beta_convert)
\n*
\n* Older error routine for production process:
\n*
\n* terminal = „*** Erroneous lower case letter in line “ line_counter
\n* terminal = line
\n* terminal = b1 :(beta_convert)<\/p>\n

*
\n* Greek uppercase letters require special treatment:
\n*
\nbe_co_*
\n+ beta_convert = ident(actual_language,language_latin) beta_convert „*“
\n+ :s(beta_convert)
\nuppercase = „*“
\n*
\n* We fetch the accents and put them BEFORE the letter:
\n*
\n*
\nstring pos(0) (span(beta_greek_accents) | „“) . s2 =
\n*
\n* We fetch the letter:
\n*
\n*
\nstring pos(0) len(1) . b2 =
\nstring pos(0) beta_iota_sub . b3 =
\ns1 = greek_upper_tab<s2 b2 b3>
\nbeta_convert = differ(s1) beta_convert s1
\n+ :s(be_co_star_ret)
\n*
\n* In the Duke data base of documentary papyri, there some cases where
\n* *) is used for ‚ (ASCII 39). This is certainly an error, but we will correct it on-the-fly
\n* here:
\n*
\n* If a space follows, we put out ‚ and space and proceed as normal:
\n*
\nbeta_convert = ident(b2,space) beta_convert „‚“ space :s(be_co_star_ret)
\n*
\n* If a bracket follows, we put it back on the input line and put out ‚ only, if this is
\n* not the case, we jump to the error routine:
\n*
\nstring = ?(b2 any(beta_brackets)) b2 string :f(be_co_star_err)
\nbeta_convert = beta_convert „‚“ :(be_co_star_ret)
\nbe_co_star_err
\n+ beta_convert = beta_convert
\n+ s2
\n+ b2
\n+ b3
\nterminal = „*** Warning: Malformed character combination in line “ line_counter
\nterminal = s2 b2 b3
\nbe_co_star_ret
\n+ s1 = ; s2 = ; b1 = ; b2 = ; b3 = ; uppercase =
\n+ :(beta_convert)
\n*
\n* Diacritics which can occur in Latin script, too:
\n*
\nbe_co_\/
\nbe_co_
\nbe_co_=
\nbe_co_+
\n+ beta_convert = beta_convert
\n+ diacritics<b1>
\nb1 = :(beta_convert)
\n*
\n* Satzzeichen:
\n*
\n*
\n*
\nbe_co_‘
\nbe_co_,
\nbe_co_.
\nbe_co_-
\nbe_co__
\nbe_co_!
\nbe_co_:
\n+ beta_convert = beta_convert
\n+ (
\n+ ident(actual_language,language_greek)
\n+ greek_zeichen<b1>
\n+ ,
\n+ latin_zeichen<b1>
\n+ )
\nb1 = :(beta_convert)
\n*
\n* Numeric symbol:
\n*
\nbe_co_`
\n+ string pos(0) (span(numbers) | „“) . s2 =
\nbeta_convert = beta_convert
\n+ space s2 space
\ns2 = ; b1 = :(beta_convert)<\/p>\n

*
\n* If a „?“ occurs, we put the combining diacritic from
\n* greek_diacritics table into the output string,
\n* „?“ otherwise.
\n* Note the alternative construction here (if – then – else = (… , …)
\n*
\nbe_co_?
\n+ beta_convert = beta_convert
\n+ (
\n+ ident(actual_language,language_greek)
\n+ greek_diacritics<„?“>
\n+ ,
\n+ „?“
\n+ ) :(beta_convert)<\/p>\n

be_co_& actual_language = language_latin
\n* & and $ may be accompanied by numbers for different font qualities (bold,
\n* italic etc.<\/abbr>) Since this is not defined in unicode, but only in word
\n* processing file formats, we just leave this out
\n*
\n*
\nstring pos(0) span(numbers) = :(beta_convert)
\nbe_co_$ actual_language = language_greek
\n* Kill all leading numbers 0-9:
\nstring pos(0) span(numbers) = :(beta_convert)<\/p>\n

*
\n* Quote symbol table for quotation marks
\n* We eat up any leading numbers and assign them to string s2
\n* We assign „0“ to s2, if there are no numbers
\n* We look up the corresponding unicode value in the quote table
\n* We put this value at the end of the resulting string
\n* Finally, s2 and s3 are reset
\n* We then proceed as normal with the next byte
\n*
\nbe_co_“
\nstring pos(0) span(numbers) . s2 =
\ns3 = quote<s2>
\nbeta_convert = beta_convert
\n+ (
\n+ differ(s3) s3
\n+ ,
\n+ b1 s2
\n+ )
\ns3 = ; s2 = ; b1 = :(beta_convert)<\/p>\n

be_co_[
\nbe_co_]
\nbe_co_{
\nbe_co_}
\nbe_co_<
\nbe_co_>
\n+ string pos(0) (span(numbers) | „“) . s1 =
\ns2 = brackets<b1 s1>
\nbeta_convert = beta_convert
\n+ (
\n+ differ(s2) s2
\n+ ,
\n+ b1 s1
\n+ )
\nb1 = ; s1 = ; s2 = :(beta_convert)
\n*
\n* Formatting codes. Notice the new caret quarter space routine:
\n*
\nbe_co_^
\n+ string pos(0) span(numbers) . s2 =
\ns2 = (convert(s2,“INTEGER“),0)
\ns2 = dupl(“ „,s2 \/ 4)
\nbeta_convert = beta_convert s2
\ns2 = b1 = :(beta_convert)
\n*
\nbe_co_@ beta_convert = beta_convert space
\n*
\n* Kill all leading numbers 0-9:
\nstring pos(0) span(numbers) = :(beta_convert)<\/p>\n

be_co_%
\n+ string pos(0) (span(numbers) | „“) . s2 =
\n(ident(s2,“1″),ident(s2,“4″)) :f(be_perc_normal)
\nbeta_convert = beta_convert
\n+ (
\n+ ident(actual_language,language_greek)
\n+ greek_percent<s2>
\n+ ,
\n+ ident(actual_language,language_latin)
\n+ latin_percent<s2>
\n+ ,
\n+ „%“ s2
\n+ )
\ns2 = ; b1 = :(beta_convert)
\nbe_perc_normal
\n+ s1 = percent<b1 s2>
\nbeta_convert = beta_convert
\n+ (
\n+ differ(s1)
\n+ s1
\n+ ,
\n+ b1 s2
\n+ )
\ns2 = ; b1 = ; s1 = :(beta_convert)<\/p>\n

be_co_#
\n+ string pos(0) (span(numbers) | „“) . s2 =
\ns1 = hash<b1 s2>
\nbeta_convert = beta_convert
\n+ (
\n+ differ(s1)
\n+ s1
\n+ ,
\n+ b1 s2
\n+ )
\ns2 = ; b1 = ; s1 = :(beta_convert)
\n*
\n*
\nbeta_convert_end
\n+ define(„EOL_convert(string)num,s“) :(EOL_convert_end)
\n*
\n* EOL_convert converts parameter \/EOL=nnn into byte string for end-of-line
\n*
\nEOL_convert
\n+ string pos(0) span(numbers) . s (any(„+,-:\/&;_“) | rpos(0)) =
\n+ :f(return)
\nnum = convert(s,“INTEGER“) :f(freturn)
\ns = (ge(num,0) le(num,255)) char(num) :f(freturn)
\nEOL_convert = EOL_convert s :(EOL_convert)
\nEOL_convert_end
\n*
\n*******************************************************************************
\n* *
\n* Main program: *
\n* *
\n* *
\n* First get program parameters: *
\n* *
\n*******************************************************************************
\n*
\nsystem = „Snobol4+“
\n&ERRLIMIT = 4; SETEXIT(CONTINUE)
\nsystem = host()
\n* Get system type:
\n&ERRLIMIT = 0
\nsystem =
\n+ (
\n+ ?(system ? breakx(„C“) „CSNOBOL“ )
\n+ „Linux“
\n+ ,
\n+ ?(system ? pos(0) „80386:Linux :Macro SPITBOL“ )
\n+ „Linux-SPITBOL“
\n+ ,
\n+ ?(system ? pos(0) „x86:Linux:Macro SPITBOL“ )
\n+ „Linux-SPITBOL“
\n+ ,
\n+ ?(system ? breakx(„M“) „Macro SPITBOL“)
\n+ „Spitbol“
\n+ )
\n*
\n* Since Snobol4+ has 16 bit integers, we initialize all counters
\n* to real values on this system; otherwise: integers
\n*
\nline_counter =
\n+ (
\n+ ident(system,“Snobol4+“) 0.0
\n+ ,
\n+ 0
\n+ )
\n*
\n*
\n*
\nwrite_counter =
\n+ (
\n+ ident(system,“Snobol4+“) 0.0
\n+ ,
\n+ 0
\n+ )
\n*
\n* Write stand-alone modules or runtime save files:
\n*
\n*
\n* If MacroSPITBOL is present, we write an execution module:
\n*
\nident(system,“Spitbol“) exit(3,“betautf8.exe“)
\n* If Linux:SPITBOL is present, we write a load module:
\n*
\nident(system,“Linux-SPITBOL“) exit(-3,“betautf8.spx“)
\n*
\n* If running under Snobol4+, we open a new output channel and write a save module:
\n*
\nident(system,“Snobol4+“) output(.saveout,16,,“betautf8.sav“)
\nident(system,“Snobol4+“) save(16) :s(end)
\n*
\n* Put out copyright string, process parameters, get file names
\n*
\nterminal =
\nterminal = „BETAUTF8 – SPITBOL\/SNOBOL4 program to convert beta code to UTF8″
\nterminal = “ “ parms
\nterminal = “ (c) Burkhard Meissner, Universitaet der Bundeswehr, Hamburg (2005-2013)“
\nterminal =
\n*
\n* Get program parameters from command line:
\n* We deliberately create system errors on all systems, calling
\n* functions (host()) and referring to key words (&parm) which have not
\n* been implemented in all systems in the same manner:
\n*
\n&ERRLIMIT = 4; SETEXIT(CONTINUE)
\nparms = &parm
\n*
\n* Special command line treatment for SNOBOL4+ (program name as first parameter):
\n*
\nparms pos(0) (SPAN(SPACE) | “) break(space) rem . parms
\n*
\n* Get parameters for SPITBOL\/CSnobol4:
\n*
\nparms = host(0)
\nparms = trim(parms)
\n*
\n* Reset error limit to zero:
\n*
\n&ERRLIMIT = 0
\n*
\n* identify input file and output file, if any; if none: error message and abort:
\n*
\nparms pos(0) (span(space) | „“) break(space) . input_file span(space)
\n+ (break(space) | rem) . output_file :f(usage)
\n*
\n* Do we regard first 32 bytes of line as references (unconverted) or not?
\n*
\nparms pos(0) breakx(„\/-„) len(1) any(„nN“) . no_ref_flag
\n*
\n* Is there an explicit EOL convention change?:
\n*
\nparms pos(0) breakx(„\/-„) len(1) („EOL“ | „eol“ | „Eol“) „=“ span(numbers „+,-:\/&;_“) . EOL_flag
\n*
\n* Do we explicitly set the actual language?
\n*
\nparms pos(0) breakx(„-\/“) len(1) any(„LlGgHh“) . actual_language (any(‚ ‚ char(9)) | rpos(0))
\nactual_language = replace(actual_language,&lcase,&ucase)
\nterminal =
\nterminal = „Input file: “ input_file
\nterminal = „Output file: “ output_file
\nterminal = „References: “
\n+ (
\n+ differ(no_ref_flag) „ignored“
\n+ ,
\n+ „present (32 bytes)“
\n+ )
\n*
\n* Display language. Note the alternative evaluation construction (SPITBOL syntax):
\n*
\nterminal = „Language: “
\n+ (
\n+ ident(actual_language,“G“) „Greek“
\n+ ,
\n+ ident(actual_language,“L“) „Latin“
\n+ ,
\n+ ident(actual_language,“H“) „Hebrew“
\n+ ,
\n+ „*** Error ***“
\n+ )
\nterminal = „End-of-line: “
\n+ (
\n+ differ(EOL_flag) EOL_flag
\n+ ,
\n+ „13,10“
\n+ )
\nterminal =
\ndiffer(EOL_flag) :f(FILE_OPEN_SECTION)
\ncrlf = EOL_convert(EOL_flag) :f(EOL_error)
\nFILE_OPEN_SECTION
\n(ident(input_file),ident(output_file)) :s(no_file)
\n*
\n* Open files. We open the output file in binary mode to continue lines,
\n* if necessary:
\n* (1) SNOBOL4 Version:
\n*
\n(
\n+ ident(system,“Linux“)
\n+ ,
\n+ ident(system,“Snobol4+“)
\n+ )
\n+ :f(test_linux)
\n* open input file:
\ninput(.in,1,“8000″ ,input_file) :f(no_file)
\n* open output file:
\noutput(.out,2,“B“,output_file) :s(program_start)f(no_file)
\n*
\n* (2) SPITBOL Version:
\n*
\ntest_linux
\n+ (ident(system,“Spitbol“),ident(system,“Linux-SPITBOL“))
\n+ :f(system_error)
\n*
\n*
\n* We know the system is SPITBOL compatible, open files:
\n*
\nsetexit(continue)
\n&errlimit = 2
\ninput(.in,1,input_file „[-l8000 -m13 -n10]“) :f(no_file)
\noutput(.out,2,output_file „[-r8192]“) :f(no_file)
\n&errlimit = 0
\nsetexit() :(program_start)
\n*
\n*
\n* Program start. Write BOM to outfile; get time to calculate time usage:
\n*
\n*
\nprogram_start
\n+ out = bom
\nstart_time = time()
\n*
\n*******************************************************************************
\n* *
\n* *
\n* Main loop: The program runs between the labels AGAIN and DONE *
\n* *
\n* Read one text line. If so done, proceed to next statement. If there *
\n* are not any lines left („failure“ condition), go to label DONE *
\n* If a line could be read, increase read counter by 1 *
\n* *
\n* *
\n*******************************************************************************
\n*
\nreference =
\nagain line = in :f(done)
\n*
\n* For compatibility with older SNOBOL versions, we set &TRIM = 1 (see above)
\n* This means: All trailing spaces are taken off upon input
\n* We want to keep these spaces, except for lines with breakes (ending in -)
\n* Therefore, we restore the space at the end, taking it off from any line
\n* which then ends in – space.
\n* To achieve this, we apply a pattern which checks for „- “ at the end of the
\n* line; if this signals success, we trim the line (by function):
\n*
\nline = line space
\nline = ?(line ? pos(0) breakx(„-„) „- “ rpos(0)) trim(line)
\n*
\n* Increment the line_counter number of lines read:
\n*
\nline_counter = line_counter + 1
\n*
\n* Replace all tabs by spaces to „normalize line“:
\n*
\nline = replace(line,char(9),char(32))
\nline pos(0) „~“ :s(short_line_header)
\n*
\n* Reference section of 32 bytes to be assumed?
\n*
\nident(no_ref_flag) :f(ref_line)
\n*
\n* Take away the reference section of our example and put it into the output line:
\n* (first 32 bytes):
\n*
\nline pos(0) len(32) . reference = :s(ref_line)
\n*
\n* block headers are shorter: write out and back up:
\n* Do not put crlf before first ~line to avoid outputting empty line:
\n* We put out crlf to close the preceeding line, if and only if:
\n* it is not the first line (write_counter > 0)
\n*
\n*
\nshort_line_header
\n+ outline = (gt(write_counter,0) crlf line, line) :(write)<\/p>\n

ref_line
\n+ line pos(0) (any(beta_latin beta_greek) | „“) . c1 (beta_add | „“) . c2 =
\n+ :f(normal)
\n*
\n* In the above statement, we have checked if the line begins with
\n* either of the two language markers ($=Greek &=Latin), possibly followed by
\n* the „+“ sign, which at the start of the line marks a continuation from the
\n* preceeding line. We use this to determine if we should close the
\n* previous line by writing the end-of-line marker to the output file (or not)
\n* We write the end-of-line marker if and only if the line is no
\n* continuation, i.e. c2 refers to the null string:
\n*
\n* We close the preceeding line, if and only if
\n* (1) it is not the first line (write counter is >0)
\n* (2) it is not a continuation line (c2 == null string)
\n*
\n*
\nout = (ident(c2) gt(write_counter,1)) crlf
\n*
\n* If the line is a continuation, we do not need the reference any more:
\n*
\nreference = differ(c2) „“
\n*
\n* If the line is a continuation, we kill the „$“ or „&“ language signs,
\n* because the line continues the language under these circumstances:
\n*
\nc1 = differ(c2) „“
\n*
\n* We set the language, if so required (if there was a language marker at the beginning
\n* of the line)
\n*
\nactual_language = differ(c1) languages<c1><\/p>\n

*
\n* Call the conversion routine, implemented as a function
\n* Assign result string to variable outline:
\n* We replace tabs by spaces in the reference section
\n*
\nnormal
\n+ outline = replace(reference,char(9),char(32)) beta_convert(line)
\n*
\n* The above statement does all the work – assigning it to the conversion function
\n* beta_convert(string)
\n* Write outline to output file:
\n*
\n*
\nwrite
\n+ out = outline
\n*
\n*
\n* Maintain output counter, increase by 1, and restart at label AGAIN:
\n*
\nwrite_counter = write_counter + 1 :(again)
\n*
\n********************************************************************************
\n* *
\n* Fatal system errors *
\n* *
\n* *
\n* Error: Unknown system type *
\n* *
\n********************************************************************************
\n*
\nsystem_error
\n+ terminal = „*** Unknown SNOBOL4 system – aborted ***“
\n+ :(end)
\n*
\n* End-of-line parameter erroneous:
\n*
\nEOL_error
\n+ terminal = „*** Error in end-of-line specification“
\n+ :(end)
\n*
\n* Error routines: File I\/O
\n* Print error and usage messages:
\n*
\nno_file terminal = „*** I\/O file(s) cannot be opened“
\n*
\n* Wrong parameters – print usage message
\n*
\nusage terminal = „Usage: betautf8.sno infile outfile“
\nterminal = “ [-n] [\/N] [-g] [\/G] [-h] [\/H] [-l] [\/L] [-eol=nn]“
\nterminal = “ Use -n or \/n parameter to skip reference section processing.“
\nterminal = “ Use this always when working with files that have not been produced“
\nterminal = “ by V&F!“
\nterminal = “ Use -g or \/g for Greek, -l or \/l for Latin, -h or \/h for Hebrew.“
\nterminal = “ Use -eol=nn,nn or \/EOL=NN;NN to change end-of-line.“
\nterminal = “ e.d.: \/EOL=13,10″
\nterminal = :(end)
\n*
\n* We have finished our work – Close files and print statistics:
\n*
\ndone out = crlf
\nend_time = time()
\nterminal = „Conversion successfully finished!“
\nterminal =
\nterminal = „Lines read: “ line_counter
\nterminal = „Lines processed: “ write_counter
\nterminal = „Time consumed: “ ((end_time – start_time) \/ 1000.00) “ seconds“
\nterminal =
\n*
\n*******************************************************************************
\n* *
\n* Explicitly close all files: *
\n* *
\n*******************************************************************************
\n*
\nendfile(1)
\nendfile(2)
\nend<\/p>\n","protected":false},"excerpt":{"rendered":"

******************************************************************************* * * * BETAUTF8.SNO * * * * SNOBOL4\/SPITBOL program to convert beta code texts to UTF8 * * Prototypical implementation to check the algorithm * * The program […]<\/p>\n","protected":false},"author":185,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-378","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/pages\/378","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/users\/185"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/comments?post=378"}],"version-history":[{"count":1,"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/pages\/378\/revisions"}],"predecessor-version":[{"id":379,"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/pages\/378\/revisions\/379"}],"wp:attachment":[{"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/media?parent=378"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/categories?post=378"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/hisalt\/wp-json\/wp\/v2\/tags?post=378"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}