Re: ANN: Simple Components v

[reinert <reinkor@gmail.com>]

I use it as part of a system processing scripts. The terms (a, b, c,..) and
operations (op1, op2,...) may represent functions to be defined.

reinert

søndag 17. januar 2021 kl. 07:54:16 UTC+1 skrev Dmitry A. Kazakov:
> On 2021-01-17 06:34, reinert wrote: 
> >>> 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)
> And what is the problem? I mean this is trivial, or I do not understand 
> your question.
> > 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.
> I do not understand this either. Set-theoretic operations form a 
> lattice, no different from Ada's logical operations "and", "or", "not" 
> plus "in", "not in". Same rules. Are asking about syntax or types involved?
> -- 
> Regards, 
> Dmitry A. Kazakov 
> http://www.dmitry-kazakov.de