To read and write to pointers in Axe, you have to enclose the pointer value in curly brackets. I believe Quigibo uses curly brackets on some of his commands, like nib{, because they take only one argument, and that argument is a pointer.

By the way, the Celtic III section seems to be malfunctioning. I accidentally stumbled into this when loading an Axe source file, because Axe uses the command det( followed by a number to allocate data sections in the compiled program. I believe all the Celtic III commands are in the format of det(number,stuff) whereas Axe uses the command in the format of det(number). Even though there is no comma after the first digit in det( calls in the Axe source file, it seems that it is being somehow intercepted by the Celtic III commands. However, because there is no comma, it doesn't actually match a token, and all it ends up doing is deleting the det( token and the first digit following it.

EDIT: It appears that this error also applies to other shell extension commands in the xml file.

Ok, here's the modified xml file. Changes include:

• Incorrect tokens/tokens with typographical errors fixed
• Duplicate/erroneous tokens removed
• Missing tokens added
• Ensured that all token strings could be typed on a standard American English keyboard (¿ and ¡ could not)
• All non-pretty statistics functions and lowercase statistics variables (all two-byte tokens starting with $62 except F) standardized to [x] format
• All single-letter special tokens (e.g. ˪, i, F, ᴇ) standardized to /x format
• All raised symbols standardized to ^^x format (not only does this seem more logical than **x to me, but also ** is an Axe Parser command that could be misinterpreted)
• Some other minor changes I'm probably forgetting about
• "Pretty" alternate strings added
• Axe Parser alternate strings added

Primary strings can all be typed on a keyboard. Alternate strings are sorted in the following manner:

Alternates that can be typed on a keyboard are first. "Pretty" alternates appear next. "Alternates" is plural because tokens that have more than one "pretty-ifiable" characters (e.g. chi^2cdf() are broken down into all possible pretty/non-pretty combinations (e.g. χ^2cdf(, chi²cdf(, and χ²cdf(). These are sorted in increasing order of "prettiness." Following any "Pretty" alternates come Axe Parser alternates, sorted according to the preceding rules.

merthsoft, do you think you could add an option to pretty-ify text? I went through the whole xml file and added lots of token alternates using non-keyboard characters that look much nicer and more visually realistic to the original tokens. Using more realistic tokens (such as Σx² instead of [Sigmax^2]) makes programs much easier to read. If I swapped the alternate strings with the main strings, or if you added some sort of "Pretty" alternate string form to the xml, could you add some sort of feature that would convert all tokens into their "Pretty" versions? Perhaps even as you type?

---

Ah ok, maybe I got confused with a different URL. I swear he posted some of his own stuff from there, tho.

And I see. Can't wait for release

Nope, never posted there.

Dang, I have no idea how to use hooks... Anyone know of a good guide explaining how hooks work? Or anyone want to post a whirlwind tour of hooks?

Straight from the zilog manual for add hl, <register>:

Quote

Condition Bits Affected:
S is not affected
Z is not affected
H is set if carry out of bit 11; reset otherwise
P/V is not affected
N is reset
C is set if carry from bit 15; reset otherwise

To be honest, I actually forgot that S and Z were ignored. I bet somewhere in one of my programs I did that wrong.

Wait, what!? Sean McLaughlin, you lied to me!

Quote from: Runer112 on November 01, 2010, 09:05:06 pm

Quote from: calcdude84se on November 01, 2010, 08:30:09 pm

Quote from: Xeda112358 on November 01, 2010, 01:07:38 am

(sorry, but I had to optimize a little  )

And I has to optimize it more. Also, your code doesn't work; it would have to be √(B²/4-AC)/A

Code: [Select]

:ClrHome
:Disp "AX²+BX+C=0
:Prompt A,B,C
:Pause -(B+{1,-1}√(B²+4i²AC))/(2A
Doesn't even change the mode settings

Two can play the optimization game.

But only one may win...

Code: [Select]

:ClrHome
:Disp "AX²+BX+C=0
:Prompt A,B,C
:B+{1,-1}√(B²+4i²AC
:Pause -2C/Ans


that works? In which case...

:ClrHome
:Disp "AX²+BX+C=0
:Prompt A,B,C
:Pause -2C/(B+{1,-1}√(B²+4i²AC


Quote from: Xeda112358 on November 01, 2010, 01:07:38 am

(sorry, but I had to optimize a little  )

And I has to optimize it more. Also, your code doesn't work; it would have to be √(B²/4-AC)/A

Code: [Select]

:ClrHome
:Disp "AX²+BX+C=0
:Prompt A,B,C
:Pause -(B+{1,-1}√(B²+4i²AC))/(2A
Doesn't even change the mode settings

Two can play the optimization game.

:ClrHome
:Disp "AX²+BX+C=0
:Prompt A,B,C
:-B+{1,-1}√(B²+4i²AC
:Pause Ans/(2A