Timeline for Changing the grouping of an user defined infix operator
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Aug 7, 2015 at 5:15 | history | suggested | Omegaman | CC BY-SA 3.0 |
Emphasized the double underscore matching pattern.
|
| Aug 7, 2015 at 4:17 | vote | accept | Omegaman | ||
| Aug 7, 2015 at 4:17 | review | Suggested edits | |||
| S Aug 7, 2015 at 5:15 | |||||
| Aug 7, 2015 at 2:51 | comment | added | I.M. |
Thanks for your feedback. You are right, Notation package is not needed here. I used it just because I had a similar problem and just copied my example with minor changes.
|
|
| Aug 7, 2015 at 2:47 | history | edited | I.M. | CC BY-SA 3.0 |
added 247 characters in body
|
| Aug 6, 2015 at 19:40 | comment | added | Omegaman |
Thanks! Turns out the Notation package isn't necessary. If I just add LeftArrow[ex1_, ex2_, ex3__] := LeftArrow[LeftArrow[ex1, ex2], ex3], it seems to do the trick. I'm new to Mathematica, and the recursive definition wasn't intuitive, but it's good to know that the more specific match is identified and made first. I think if you remove the reference to Notation, and add text to emphasize the double underscore on the z__ arg (which I overlooked for a while), then this is the answer I'm looking for.
|
|
| Aug 6, 2015 at 7:49 | history | answered | I.M. | CC BY-SA 3.0 |