Re: Improving P2Ada

[Gautier <gautier.demontmollin@maths.unine.ch>]

Thanks for replies...
The P2Ada way doesn't seem the only one.
Though, here is what I would/will add to current P2Ada (2.2) to
let it translate happily Borland-style sources:

  * no forced order in CONST, TYPE, VAR, PROCEDURE/FUNCTION clauses
    (like Ada 95) - most TP programs aren't "Pascal orthodox" on this
    point (fortunately), so P2Ada fails there...
  * CASE statements can have an ELSE part ( when others=> in Ada )
  * there are ASM..END blocks like BEGIN..END (just comment out the
    assembler opcodes...)
  * there are SHL & SHR binary operators ( shift_left(.,.) in Ada )
  * strings can have explicit ASCII characters: 'Blabla'#13#10're-blabla'
    that would become "Blabla" & character'val(13) & ...

A later but more "banana-skinny" step is the OO part; to begin with...

  TYPE xyz = OBJECT         ->  type xyz is tagged record
  TYPE xyz = OBJECT(abc)    ->  type xyz is new abc with record
  PROCEDURE xyz.toto;       ->  procedure toto(prefixed_obj: xyz) is

G.