comp.lang.ada
 help / color / mirror / Atom feed
From: reinert <reinkor@gmail.com>
Subject: Re: ANN: Simple Components v
Date: Sat, 16 Jan 2021 21:34:49 -0800 (PST)	[thread overview]
Message-ID: <38687765-d3ee-4966-a4e3-c975bd73ceadn@googlegroups.com> (raw)
In-Reply-To: <rtssip$1q73$1@gioia.aioe.org>

> > Convert between prefix, infix, postfix notation?
> Convert what?
> -- 

Here is a reference to the topic:

https://www.geeksforgeeks.org/convert-infix-prefix-notation:

Simple example:

a + b <-> +(a,b)

The expressions could be more complex:

(a op1 b op2 (c + (d op3 e))) op4 ((f op5 g) op6)

where op1, op2 etc are operators (functions).

This may be standard for those making compilers.
I use it to process sets (where operators are intersection, union etc)
and a, b, c, ... above can be references to functions returning Ordered_Sets.
This is a good  exercise in using recursive procedures/functions :-) However, I would
like to see possibilities to generalize my approach (using for example generics).

  reply	other threads:[~2021-01-17  5:34 UTC|newest]

Thread overview: 13+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2021-01-13 12:01 ANN: Simple Components v Dmitry A. Kazakov
2021-01-15 19:42 ` reinert
2021-01-15 20:05   ` Dmitry A. Kazakov
2021-01-17  5:34     ` reinert [this message]
2021-01-17  5:37       ` reinert
2021-01-17  6:54       ` Dmitry A. Kazakov
2021-01-17 16:20         ` reinert
2021-01-17 16:55           ` Shark8
2021-01-17 17:17             ` reinert
2021-01-17 17:38               ` Dmitry A. Kazakov
2021-01-18  6:50                 ` reinert
2021-01-17 17:27             ` Dmitry A. Kazakov
2021-01-17 17:26           ` Dmitry A. Kazakov
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox