Re^3: Parsing Boolean expressions (hack)

> You can almost parse the expression with the same technique.

not really, for a syntax tree you would need an [OP, arg1, arg2] format.

this

["B", "'", "+", ["C", "*", "D"], "'"]]

doesn't help without further parsing because precedence is still not resolved.

Rather

[ "or", 
    [ "not" , "B" ] , 
    [ "not", 
        [ "and", "C", "D"]
    ] 
]
[download]

without recursive parsing hard to achieve, I just delegated the hard part to Perl, deliberately ignoring what the OP didn't tell us yet.

For instance if the = is not an assignment but a condition, he would want solutions for this equation system...

(which I could produce at least by brute force for small variable sets, if we had a guarantied format)

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Je suis Charlie!}

Comment on Re^3: Parsing Boolean expressions (hack) Select or Download Code

Replies are listed 'Best First'.
Re^4: Parsing Boolean expressions (hack) by Anonymous Monk on Apr 23, 2017 at 16:00 UTC
Yeah, that's why I said "almost." You need to postprocess it a bit to get a proper syntax tree.	[reply]
Re^5: Parsing Boolean expressions (hack) by LanX (Saint) on Apr 23, 2017 at 16:04 UTC
> You need to postprocess it a bit to get a proper syntax tree. well ... a bit Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :) Je suis Charlie!}	[reply]
Re^6: Parsing Boolean expressions (hack) by Anonymous Monk on Apr 23, 2017 at 16:28 UTC
Well, yeah. The postfix quote is the biggest irritation, but you can just run `for my $i (reverse 1 .. $#$e) { splice @$e, $i-1, 2, ["'", $e->[$i-1]] if $e->[$i] eq "'"; }` [download] over each of the arrayrefs.	[reply] [d/l]
Re^7: Parsing Boolean expressions (hack) by LanX (Saint) on Apr 23, 2017 at 16:40 UTC
Re^8: Parsing Boolean expressions (hack) by Anonymous Monk on Apr 23, 2017 at 18:01 UTC