Re: S-expression I/O in Ada

[Natacha Kerensikova <lithiumcat@gmail.com>]

On Aug 13, 11:08 am, Ludovic Brenta <ludo...@ludovic-brenta.org>
wrote:
> Natacha Kerensikova wrote on comp.lang.ada:
> > Consider these two objects:
>
> > L--A--tcp-connect
> >    |
> >    L--A--host
> >    |  |
> >    |  A--foo.example
>
> This part cannot exist: the second L cannot have more than 2 children;
> here you gave it three (A, A and the next L). The dot notation would
> have prevented that mistake :)

No, it has only two children: the A connected to "host" and the L you
haven't quoted. All the nodes in both my graphs have exactly one
"right child", which is their value, and zero or one (but not more)
"lower child" being the next element in the list, i.e. the second
argument of cons.

So if you really want a dot notation, here is the first object:
(tcp-connect .
   (
       (host . (foo.example . nil))
   .
      ((port . (80          . nil)) . nil)
   )
)

while the second one is:

(tcp-connect .
   (
      (
          (host . (foo.example . nil))
      .
         ((port . (80          . nil)) . nil)
      )
   .
      nil
   )
)

I hope my vertical alignment will make these cons pairs clear enough.


Hoping to finally understand,
Natacha