Well, if I have the hex, I can package it as an app for you.

What would you do about the absolute jumps though?  If there was a jp $9D9A in the code you would have to remap it to jp $4005.  With only the hex code, you have to disassemble it and it would be pretty cumbersome to do.

I didn't know ion wasn't an app.  Hmm... now that I think about it, maybe it is possible, but what you would have to do is write some code to a safe ram area that is able to run the new program and then re-open the shell again after it returns.  Then you would have to jump to that location and hope that the client code doesn't write over that area.  All of that still requires a lot of inline ASM.

But all the app does is copy it to the ram and run it.  Just by the nature of how absolute jumping works, there's no way it could be converted to an app unless it was actually being emulated but I highly doubt that becasue then it would be unreasonably slow.

Okay, I downloaded openoffice and I think I get the hang of it.  I'll post a list of articles that need to be written.  Don't feel pressured to write something you don't want to becasue I'm going to be writing whatevers left over anyway.  And I'll be rewriting or rewording the articles to make them transition between each section better so don't worry about that, its the core content that's most important.

If you want to do one, post your request here.  First post first pick to avoid duplicates:

• What is Axe Parser?  What can/can't it do?  Advantages/Disadvantages Quigibo
• How syntax looks/Differences with TI-BASIC Quigibo
• How to use the Parser Quigibo
• Numbers (hex vs decimal, signed vs unsigned, 1 byte vs 2 byte)
• Labels, Subroutines, and program flow.  Order of operations.
• Pointers 101 What are they? How do they work?
• Data, Memory, how to read and write to them.  Making sprites/strings/maps.
• Reading/Writing/and creating Save Files.  How to archive/unarchive
• How to optimize/neat tricks.
• Writing a simple game: A tutorial. SirCmpwn

Plus there are the Individual commands.  Each one should have 1 or 2 examples and a short paragraph sized explanation.  Some commands might need more or less though depending on how complicated they are.  I'll put the list of done commands right after this:

N/A

I have to write the "Using the parser" one becasue its changing next version with new options like shell support.  When you finish one, just upload it here as an attachment.

Everywhere in that sample where you used "B" just replace it with "L1".

That definitely shouldn't cause a RAM clear.  What is the other code you put around it?

Originally, it was unintentional, but it produces the smallest code.  It could return the answer, but then it adds an extra byte or 2 every time you store to a pointer.  Both ways have advantages in optimization.

You can optimize this:

A->{L1}
B->{L1+1}
C->{L1+2}

like this:

C->{B->{A->{L1}+1}+1}

So don't think that its a bad thing it returns the pointer, there are some good things you can do with it.

What are you doing exactly that requires so much speed?  Maybe its the method you're using that can be optimized.