RE: very specific question on Ada syntax

[Robert Dewar <robert_dewar@my-deja.com>]

In article <mailman.980529197.22106.comp.lang.ada@ada.eu.org>,
  comp.lang.ada@ada.eu.org wrote:
> Conjecture: that restriction is necessary in order to
> tokenize a character_literal without semantic or sintactical
> analysis.

Since the truth of this depends on your arbitrary definition
of what is and what is not sintactical analysis (I leave the
misspelling to emaphasize that in fact this is NOT a standard
precisely defined technical term :-), this is not a well
formed conjecture.

In fact properly written lexical analyzers for Ada solve this
in the manner I previously posted, WITHIN the lexical analyzer
(this is perfectly possible either in a hand written lexer, or
in an automatically built one). The method is simple and
probably the only reason it is not used is simply a matter of
not being aware of this standard technique which has been well
known for 20 years (i.e. check previous token).





>
> Proof: (left as a home assignment ;-)
>
> 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
>
>


Sent via Deja.com
http://www.deja.com/