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=-2.9 required=5.0 tests=BAYES_00,MAILING_LIST_MULTI autolearn=unavailable autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,6d9eb594a33cb947 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-01-29 03:07:22 PST Path: supernews.google.com!sn-xit-02!supernews.com!isdnet!enst!enst.fr!not-for-mail From: Mario Amado Alves Newsgroups: comp.lang.ada Subject: RE: very specific question on Ada syntax Date: Mon, 29 Jan 2001 11:11:01 +0000 (WET) Organization: ENST, France Sender: comp.lang.ada-admin@ada.eu.org Message-ID: Reply-To: comp.lang.ada@ada.eu.org NNTP-Posting-Host: marvin.enst.fr Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: avanie.enst.fr 980766440 84233 137.194.161.2 (29 Jan 2001 11:07:20 GMT) X-Complaints-To: usenet@enst.fr NNTP-Posting-Date: Mon, 29 Jan 2001 11:07:20 +0000 (UTC) To: comp.lang.ada@ada.eu.org Return-Path: X-Authentication-Warning: lexis.di.fct.unl.pt: maa owned process doing -bs In-Reply-To: <94vpi8$lrc$1@nnrp1.deja.com> Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org X-Mailman-Version: 2.0 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: comp.lang.ada mail<->news gateway List-Unsubscribe: , List-Archive: Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org Xref: supernews.google.com comp.lang.ada:4648 Date: 2001-01-29T11:11:01+00:00 "Restriction: no one-character attribute designators. Conjecture: that restriction is necessary in order to tokenize a character_literal without semantic or syntactical analysis." (Alves, revised) "Since the truth of this depends on your arbitrary definition of what is and what is not syntactical analysis [...]" (Dewar) Syntactical: ranging more than one lexical element. A lexer may be purely morphological, i.e. based solely on the individual form of each element. But that is rare. An Ada lexer must have some syntax---so the conjecture is true! "[..] properly written lexical analyzers for Ada solve this" (Dewar) It is nice to know my personal lexer is "proper" apud Dewar :) Excerpt: when ''' => if Previous_Kind = Identifier or (Previous_Kind = Delimiter and To_String(Previous_Form)=")") or Previous_Kind = Reserved_Word_All then Send(Delimiter, C); else State := Character_Literal_1; end if; And I was surprised much hyped systems (OpenToken, AdaGIDE...) fail this! Thanks. | |,| | | |RuaFranciscoTaborda24RcD 2815-249CharnecaCaparica 351+939354005 |M|A|R|I|O| |A|M|A|D|O|DepartmentoDeInformaticaFCT/UNL 2825-114 Caparica 351+212958536 |A|L|V|E|S| fax 212948541 | | | | | | maa@di.fct.unl.pt FCT 212948300