Show Posts

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.


Messages - lookitsan00b

Pages: 1 ... 5 6 [7] 8 9 ... 13
91
TI Z80 / Re: Breakout clone
« on: December 11, 2010, 05:38:17 pm »
NECROPOST!!! (but a good reason, and it IS my thread...)

I can't believe I never though of this earlier, but what about a:

Spoiler For Spoiler:
MULTIPLAYER MODE!!!!

 :w00t:

I think its a great idea ;D Never worked with a link cable before tho.

92
TI Z80 / Re: FALSE
« on: December 11, 2010, 01:11:47 pm »
well, a bit of an update:

wow. so far, absolutely no crashes. Not even when I abused the stack (ie pushed something and didn't pop it, or tried to pop an empty stack(1)) All I've got so far is bugs :(

Had a couple problems with inline numbers and numeric output. that fixed easily enough(and my numbers display as signed 16-bits with no extra padding!)

my () and ' commands so far only support 1-byte tokens. that'll just be annoying to fix.(2)

my ^ command is having fun :P A continuous scrolling 1 until you press a key, when it spits out garbage. I know one of the Fix commands fixes that (or part), but I still do want it to scroll down when it hits the bottom... (I think). Either way, the garbage reminds me of b_call(_puts) with a random hl, but I am using >Tok... (still does the garbage when i stopped it from scrolling) :banghead:

getkey is the same numbers whether or not I use parentheses, right? cause alpha (48) doesn't seem to be working.

Also, I'm still using 0.4.5 :P

Also, my strings are displaying vertically(3) :P

Spoiler For Spoiler:
(1): This doesn't mean Axe cleans it up for me. I'm not taking that chance. It just means my stack-length variable is working.
(2): Cue get_token subroutine...
(3): Apparently I missed one Output( command when switching from TI-Basic

93
TI Z80 / Re: FALSE
« on: December 11, 2010, 12:20:26 am »
dim(L1) returns the dimensions of L1. so if L1 = {3,6,2}, dim(L1) = 3.

or do you mean axe?

Yeah I needed to know how big L1 is in Axe. Found it, tho. 712, if my math is correct.

94
TI Z80 / Re: FALSE
« on: December 11, 2010, 12:04:31 am »
Huh, interesting. I've never heard of FALSE before. Honestly I've never understood esoteric languages or how they work or anything :P (Not that I've really tried though >.>)

Anywho, that's cool. It seems interesting. Good luck on it.

Thanks. I'll need it. Sure, its a stack-based language, but who would've guessed porting it to Axe would involve so many Asm(E5)'s and Asm(E1)'s?

Btw, anybody know dim(L1) off the top of their heads? ??? No current access to the documentation...

95
Math and Science / Re: Stupid SaT math question
« on: December 10, 2010, 08:15:18 pm »
Well I took the SAT last week and I found what I think is stupidest question ever on it.

Solve for X
X*1 = 3/5

Isn't the SAT supposed to measure readiness for college?!?! This is more like readiness for 6th grade!!!!

For those in the US, I assume you're aware of the No child Left behind BS that forces those state tests. On one I had a long time ago, it asked what the name of a rectangular shape with four sides at 90 degress from each other was:

A) Triangle.
B) Circle
C) Rectangle
D) Parallelogram.

 ::)

But the SAT doesn't qualify as a state test does it? I thought it was produced independently by The College Board.

actually they throw in the stupid questions so that people who know nothing else will still get at least a 1 for knowing that...

96
The Axe Parser Project / Re: Axe Parser
« on: December 10, 2010, 08:10:27 pm »
I'm not worried about T. I'm worried about the fact that {...} can cut off the end of a two byte token, and {...}r can be one of three things:

 1: two one-byte tokens
 2: a one-byte token followed by the first half of a two-byte
 3: a two byte token.

I also need to know how much to increment my 'PC'... which is a pointer to the next token in the program string.

97
The Axe Parser Project / Re: Axe Parser
« on: December 10, 2010, 07:53:06 pm »
On second thought, I could just check a 1-byte value against all my 1-byte tokens, and then, if i got no hits, load the second byte and check all the two-byte tokens...

But I don't want to have to look all my tokens up in a table... ah well... tibasicdev has a good table.

98
The Axe Parser Project / Re: Axe Parser
« on: December 10, 2010, 07:44:26 pm »
From a string, and so that I can interpret them.

as in:


If A=T+
Goto PL
End
If A=T-
Goto SB
End
...

Except not all of my symbols I need to check are 1 byte tokens.

99
The Axe Parser Project / Re: Axe Parser
« on: December 10, 2010, 07:35:46 pm »
how about parsing them tokens? how do I do that? ???
The main problem is the variable token size... and that I need to check for tokens of both sizes.

100
The Axe Parser Project / Re: Axe Parser
« on: December 10, 2010, 06:05:04 pm »
ok I can avoid using it in calls (or just use 'pop de/pop hl/push de' etc), and using it to store/recall the Ans is exactly what I'm using it for.
Also, I'll have a counter so that I know how many items are in the stack at a given time. Also gotta avoid using it in the middle of routines. like no Output(0,0,Asm(E1)>Dec), that'll probably cause an error

EDIT: also, while I'm here, "Str1" is sufficient for a GetCalc( filename, right?

101
The Axe Parser Project / Re: Axe Parser
« on: December 10, 2010, 05:54:54 pm »
just wondering: is it safe to embed random Asm(E5)'s and Asm(E1)'s into an axe program? (I mean other than the obvious problems of the stack not exiting the same as it entered)

I mean, can I push data onto the stack and count on axe to leave it all intact and contiguous? (except when using inside parentheses, I know that)

btw,  E5 and E1 are 'push hl' and 'pop hl', respectively

If not, I'm pulling out Mimas...

102
TI Z80 / Re: FALSE
« on: December 10, 2010, 04:52:13 pm »
I have now implemented: +-*/_=>~:;.,[]!#ß\$ (replaced _ with (-), ; with r, ~ with =\=, # with i(imaginary), ß with o, \ with e(euler's constant), and $ with pi)
I need good symbols to replace: &|%@ø

I figured out what ß does, but decided it was useless in the current setup, and replaced it with a clrHome/cursor reset. Basically the same.

Due to speed problems, I think I'll add '.FALSEINT' to the beginning ;)
You'll still have to run from an external string, though.

Screenshot of speed, and an attempt at the awesomeness of WFRNG. oh and the part where the numbers go faster is when I enabled warp mode on wabbit wow apparently wabbit maintains screenshot speed even in warp mode... but it runs a little slower on-calc.

Awesome!  I love these little mini languages :D Why is it called False?
Well, according to the author, its because that's his favorite truth value. :P

103
TI Z80 / FALSE
« on: December 09, 2010, 09:57:23 pm »
In direct opposition to the BF interpreter, I give you the FALSE interpreter! (beta 0.7903) Written in TI-Basic, it has to be the fastest TI-Basic based language ever :w00t: (except BF, but easier to write code for and read)

The official command set is:

arithmetic operations: +-*/_
Logical operations: =>&|~
Stack operations: $%\@ø
variables ops: :;
program control: []!?#
strings/chars ops: " '
and IOStream commands: .,^ß
What do these random symbols do?

I have currently implemented: +-*/_=>~:;.,[]! (replaced _ with (-), ; with r, and ~ with =\=)
Working on: #. I'll use w (that's the graphing variable)
I need good symbols to replace: &|$%\@ø and maybe ß (not sure what it really does)

EDIT: ' and " are fully functional, and ^ is mostly working. I decided to use ()'s for double quotes.

Oh, and sample code: (doesn't work in current release)
(Pick a numbar)0,':,^A:1 1:1 2:(Guess the numbar  )1 1:1 2:[0,':,^Ar=~[0,(Nope!)Br!]?]B:Br!0,(You win!)
...where ~ is the not equal sign

104
Other Calculators / Re: Simple yet useful virus
« on: December 09, 2010, 08:21:35 pm »
Sentry is a program That lets you password protect certain menus (Your choice of program, APP, and memory menu). It is actually pretty cool. I found ways around it though... Including manually typing "Asm(prgmSENTRY" to unlock it. After that, I started deleting Sentry after installing it because it set hooks in RAM, so it worked without the program :D
Couldn't you just archive it? all your shells are blocked, so you can't run it from there.

105
TI-BASIC / Re: [TI-Basic] umm... error?
« on: December 06, 2010, 04:44:47 pm »
wow. found a typo in the decryption code :P
also made a random key generator. (inspired by JustCause's Secure (Ish) Cipher)

this really is a somewhat modified version of the Playfair Cipher. instead of adding an 'X' or 'Q' between two equal letters, I just let them slide through.  This might be a bit of a security concern (although it makes it harder to identify as a playfair cipher), so to make it more secure, you can change that easily or encrypt, add a letter to the beginning, and encrypt again. (or even decrypt :P)

I'm not sure if this really deserves a project thread. I don't really plan on adding much more.

EDIT (before post): wow... I forget to rename the readme and get an error... then I fix it, it says I've already posted.  I go and look at it, there is no post there. I re-open the reply page, copy & paste the text and reselect the files (none of which have the same name as any others on this thread) and... it says there is already a file with that name. :banghead:

Pages: 1 ... 5 6 [7] 8 9 ... 13