The parser seems to be handling the large amounts of data just fine. It takes a second or two to get through it all but it works.

---

And you were wondering what the data is?

I was wondering Quigibo because I plan on making a project in which tiles will appear in groups of 16 at a time, with each tile being either white or black.

16 bits (2 bytes) * ~50-100 tile groups per level * 50 levels = ~5-10KB

There is another way to get the Nth arbitrary pointer (not consecutive not the same size) but its a little more complicated and involves pointers to pointers.

Want to clarify for me? Because all my data sets are of different sizes

I'm having a bit of trouble getting GetCalc(PTR) to locate things. Is it possible to find the pointer of a previously defined piece of data like GDB01? And if so, why does something apparently straightforward like this not work:

:[FF]→GDB01
:"GDB01"→Str01
:Disp GetCalc(Str01)►Dec
Does this possibly have something to do with the fact that GDB0 is a two-byte token? When I display Str01, it doesn't display "GDB01", it displays "a{1". It looks like it's breaking the two-byte GDB0 token into one-byte characters.


EDIT: On closer inspection, it appears this command was meant for AppVars, so this approach probably doesn't make sense anyways. However, my question from the second sentence still stands: How can I get the pointer of a previously defined piece of data such as GDB01, but without actually saying GDB01→something? It would be nice to be able to get the pointer of a piece of data with a variable ID, such as GDBA, where A=01.


ANOTHER EDIT: Just a quick question, would GDB1 and GDB10 be the same thing?

---

Why do I keep not realizing I'm about to double-post until it's too late 

Ok, here's a problem I'm getting close (about 1KB) to running into:

How do you compile a program that is large enough to not leave enough free RAM for both itself and the compiled program?

I was wondering Quigibo because I plan on making a project in which tiles will appear in groups of 16 at a time, with each tile being either white or black. This works out very well using rand to generate 16 tiles at once, but it is then somewhat difficult to extract the 16 individual bits.

I just have a bit of a programming question (I'm not sure where else to ask questions like this):

How can you easily work with bits instead of bytes? That is, is there an easy way to pull out the individual bits in a byte, and vice versa?

Well, i thought i did, it turns out the app it created was bad anyway, and when i try to convert the rom under windows 7, it just says wabbit.exe has stopped working and no app is created.

Just a note, I have the same problem as souperman11. I don't think the ROM is bad; I can play it just fine on a GameBoy emulator for my computer. When I drag the file on to the batch file, it gets to "Pass one..." and then wabbit.exe crashes.

Oh and in case you wanted to know or anything, I'm on XP.

First of all, amazing work. When Gameboy emulation was achieved for the TI-89, I thought about how amazing that was. And now to get it on the TI-83 and -84 is even more incredible.  

I was testing this out by playing The Legend of Zelda - Link's Awakening, which runs extremely well. However, I have noticed one problem. To save, you have to press A, B, start, and select all at once, and you can't do this on a calculator. Could you add a button to emulate the pressing of A, B, start, and select all at once?