From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 10ad36,eb29ffe585cb20aa,start X-Google-Attributes: gid10ad36,public X-Google-Thread: fc89c,eb29ffe585cb20aa,start X-Google-Attributes: gidfc89c,public X-Google-Thread: 10261c,eb29ffe585cb20aa,start X-Google-Attributes: gid10261c,public X-Google-Thread: 10cc59,eb29ffe585cb20aa,start X-Google-Attributes: gid10cc59,public X-Google-Thread: 103376,eb29ffe585cb20aa,start X-Google-Attributes: gid103376,public From: z007400b@bc.seflin.org (Ralph Silverman) Subject: International Algorithmic language Date: 1997/08/08 Message-ID: <5sfeus$a1i@nntp.seflin.org>#1/1 X-Deja-AN: 262998223 Organization: SEFLIN Free-Net Keywords: 'c' programming language computer Newsgroups: comp.unix.bsd,comp.lang.pascal,comp.lang.pascal.misc,comp.lang.ada,comp.unix.programmer Date: 1997-08-08T00:00:00+00:00 List-Id: internationalization of algorithmic language one good idea involved in the 'c' programming language is the replacement of 'eurocentric' expressions in the 'operational heart' of the language, with more international expressions ... thus BEGIN END ( then traditional in 'algol-like' languages ... ) becomes { } or .EQ. ( then traditional in fortran ... ) becomes == ... interestingly ... a 'c'-like language simplified to its roots and similar, in this, to 'c' at origin could easily forgo all such 'eurocentricisms' in forgoing the use of alphabetic characters for such things ... main() for instance, 'main' function name could be replaced with symbol indicating 'entry point'-like role ... thus main() becomes ->() ( may forgo present use of '->' by requiring strict use of pointer only as identifier of derived data type ... ) loops only one loop form is needed ... if similar in effect to traditional while(1) symbol for such would be <> of course ... substitute for break would be needed ... and a generic break regime should be used ... thus loop-break would be ... ~<> if ... else might be ? ... : ( present ?: is a kind of meta-version and might be ) ^? : ... thus /* code here ... */ <>{ /* code here ... */ ?( >= i TOP05 ) ~<>; } /* <> */ ( present author prefers pre-fix notation arrangement where feasible ... ) types fundamental data type is minimum size word represented as >< ( this is signed ... ) unsigned ... >><< non-derived, non-pointer data-types are sized, in terms of this 2>><< 2>< 4>><< ... ( arrays much as now ... ) structures |>><<| {} ... internationalization of algorithmic language ( part b. ) static storage automatic storage of 2(minimum) word is 2>< /* signed */ 2>><< /* unsigned */ static storage is 2>-< 2>>-<< /* similarly */ meta-type float can be thought of as a meta-integer so float type might be ... ^>< ... switch or case may be eliminated by break from program block ( where series of ? forms are within same block ... ) (~{) ( of course if and if...else also do this now ... ) (no)s no enum no set no union no passing derived data-types ( but pointers good, of course ! ) internationalization of algorithmic language ( part c. ) addendum (no)s /* added */ no bitfield return return form is <-< as <-<(i); internationalization of algorithmic language ( part d. ) addendum continue form form of 'continue' is <-<> register form 'register' form is 2>+< /* for instance */ >+< 'non-default' auto variable could be >*< /* could be 'non-default' auto form */ 2>>*<< 2>><< /* default form of auto ... */ 2>>-<< /* e.g. of static ... */ internationalization of algorithmic language ( part e. ) addendum function declaration function declaration will not be based on traditional form ... int fname(); /* NO */ instead 'meta' form of return value will indicate role .. 2>^< fname; /* yes */ (no)s no 'no type' type ... unspecified function return type ... defaults to implementation specific value . -- Ralph Silverman z007400b@bcfreenet.seflin.lib.fl.us