TI-BASIC competition

[grosged]

En utilisant un programme de ma conception:

( Téléchargeable ici )

Il est en 2 parties:

Tout d'abord , on (ré)initialise le WatchDogTIMER (voir plus en détails ici: http://wikiti.brandonw.net/index.php?ti ... Ports:6000)

en tapant Asm(prgmWDTRESET

Puis on lance notre programme Basic à mesurer.

Enfin , on lance la lecture du chrono au moyen de Asm(prgmWDTREAD
à ce moment-là s'affiche une valeur, que l'on va diviser par 32768 pour obtenir le résultat final (en secondes)

[noelnadal]

It has been more than one week already. Is there a second task ?

[PT_]

It has been more than one week already. Is there a second task ?

Tomorrow evening

[noelnadal]

Great.

[Adriweb]

Il me semble qu'il est davantage recommandé d'utiliser les GPT que les Watchdog timers, pour de tels usage, mais bon

[PT_]

Il me semble qu'il est davantage recommandé d'utiliser les GPT que les Watchdog timers, pour de tels usage, mais bon

I've created a very accurate stopwatch, not based on the WatchDog Timer
You can download it here:
https://www.cemetech.net/programs/index ... /TIMER.zip
Read the README for more details

[grosged]

Bah, je suis fidèle à mon Chien "WatchDog", c'est tout !..
Moi je dis qu'on peut "compter" sur lui

[Adriweb]

Bah, je suis fidèle à mon Chien "WatchDog", c'est tout !..
Moi je dis qu'on peut "compter" sur lui

[PT_]

And... it's time for da second task!
I hope you all liked the first one, and if not, sorry for that

We all love TI-BASIC, right? That's why we're participating. In TI-BASIC, it's sometimes necessary to store an expression in a string, for example when reading from an appvar. To get the actual value of that, we do have the command expr(. But what can expr( do? Well, it's mostly for math. There are more functions you can't do with that, than you can. But don't be frustated, math is as funny as well. There are many, many math commands (look in the Catalogus if you don't trust me), but some of them we don't need. But do you also believe that it parses not only math? You can even have a list or matrix stored in the string.
And that is what this new task is about. You have to write an algorithm that parses a string, like expr( does. Of course, there are some limits.
1) We don't need all the math commands, only this commands are in the string: *-/+^().0123456789sqrt(
2) You're not allowed to store the string elsewhere, and get the value by calling that function. Such as String>Equ( : Y1(1 is not allowed. Like that, |u, |v, |w and even storing it to a list is not allowed. Maybe there are more ways to get it directly - not allowed. You have to parse the string yourself.
3) You're not allowed to have expr( in your whole program (duh )

To summarize this all:

Task 2

Create an algorithm that parses a string with the following characters in it: *-/+^().0123456789sqrt(. The input is in both Ans and Str1. You may assume the length of the string is not more than 99, and more than 10. Again, the time is measured over 10 times parsing a string. An example would look like this:

Code: Tout sélectionner

1.59*(5^3-9.5)/(5/3)^sqrt(4-2

In this case, the output should be 89.173866... The order of operations are important. The output value should be in A, as many decimals as a TIOS variable can store. As you can see, the input doesn't need to close parenthesis.
The scoring is the same as task 1, so you know speed is more important as size..

I wish you all good luck, and if you don't like this one, remember this is only #2, and there are more coming task which are that hard....
If you have any questions, please ask!

[Bisam]

Does the parser need to throw an error if the string does not contain a valid sentence or the string should be assumed valid ?
E.g., can a string contain 3(+5 ?
This considerably changes the time...