2386
TI-Nspire / Re: TI-Nspire GB Emulator
« on: February 12, 2010, 09:32:46 pm »
I'm currently working on adding some OS interfacing, like using malloc to request RAM and hopefully saving/loading save games using actual Nspire files
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to. 2386
TI-Nspire / Re: TI-Nspire GB Emulator« on: February 12, 2010, 09:32:46 pm »
I'm currently working on adding some OS interfacing, like using malloc to request RAM and hopefully saving/loading save games using actual Nspire files
2387
The Axe Parser Project / Re: Features Wishlist« on: February 09, 2010, 11:38:20 pm »The next version has already taken care of getting 'illegal' characters into strings using standard tokens.But shouldn't << be shift left or something? Also, bitwise and boolean OR are different. 5 | 2 = 7 5 || 2 = 1 (and the "2" expression isn't evaluated because 5 is non-zero) 2388
The Axe Parser Project / Re: Features Wishlist« on: February 09, 2010, 07:25:56 pm »Great idea! I assume you mean strings would look like this: "Part 1"+?41+"Next Part"+Str1 If Str1 was "Hi" then it would result as "Part 1ANext PartHi". Sounds cool.Actually, I was thinking "Part1?X41Next Part"+Str1. The X might not be necessary I guess, but it might simplify parsing. To put a question mark in a string, you would use "??" 2389
The Axe Parser Project / Re: Features Wishlist« on: February 09, 2010, 06:45:40 pm »
I have a suggestion for the parser. You should have a character (I'm thinking "?") that acts as an operation modifier, for things that can possibly have more than one use. For example, "?>" could be used as signed compare, and "? or " would be bit-wise or, while " or " would be boolean or. It could also be used in strings as an escape character, for example ?" would put a quotation mark in the string and ?X41 would put the character 0x41 (or "A")
2390
News / Re: A new 84+ OS ???« on: February 08, 2010, 12:22:19 pm »
Well the bugs that have been shown all seem to happen because inverted text doesn't act quite like it used to. I think pure Basic things could be fine.
2391
Pokémon Purple / Re: [PP] Progress '10« on: February 07, 2010, 10:50:56 pm »
I just noticed, when Ash is auto-moved up when he tries to leave, he's still facing down. (unless down/up look the same and I'm crazy)
2393
General Calculator Help / Re: Kirk Meyer's Graph3--Easter Eggs« on: February 06, 2010, 08:17:39 pm »
I thought about putting an easter egg in Chip's Challenge but I never got around to it.
2394
General Calculator Help / Re: Kirk Meyer's Graph3--Easter Eggs« on: February 05, 2010, 10:12:01 pm »
I think you have to press ZOOM twice while viewing a graph
2395
The Axe Parser Project / Re: Axe Parser« on: February 05, 2010, 08:01:00 am »I think the only way to speed up anything related to text display is to have a custom font routine, though. I am not sure how easy it would be to implement such thing for Axe parser, especially for home screen stuff, where it might be impossible.I think the problem here is that the output ASM program has to work on its own, so all the font data and routines would be unnecessary overhead 2396
The Axe Parser Project / Re: Axe Parser« on: February 04, 2010, 06:54:17 pm »I am confused by what this means. Does it means it would be only possible to mutiply by 2, 4 and the like? It might become an issue for example if I did a small RPG where your max HP and attack power was like 101 x character LVHe's just saying that it would be slower to multiply by anything else because it would call a general routine instead of adding manually Edit: Ninjaaaaa 2397
The Axe Parser Project / Re: Features Wishlist« on: February 04, 2010, 12:02:28 am »Sorry to double post, but I've just started to add the "Output()" feature and I'd like to get some feedback on it.I think you should keep the old way, but start counting at 0 instead of 1. 2398
The Axe Parser Project / Re: Axe Parser« on: February 03, 2010, 11:45:58 pm »Thanks for that division routine, but I found this one and its a lot smaller.You are correct. You can replace it with "scf \ rl c" though Edit: Also, if you haven't done this already, I'd like to suggest that you auto-generate multiplication algorithms when multiplying by constants. Like A*9 would become: Code: [Select] ld hl,(var_a)
2399
The Axe Parser Project / Re: Features Wishlist« on: February 03, 2010, 05:54:26 pm »
Apparently you can't break at all, so it doesn't matter. But Quigibo, if you save the stack pointer somewhere at the beginning of execution, it should be no problem (this method is used quite a bit in asm programs iirc)
2400
The Axe Parser Project / Re: Axe Parser« on: February 03, 2010, 05:51:25 pm »
Hold up, found a more efficient method (and I put it into loops just for you
![]() Code: [Select] div_hl_de:
|
|