Hardmath123 wrote:
scimonster wrote:
Hardmath123 wrote:
|ˈzēˌnän; ˈzenˌän|
?
Dictionary pronunciation guide.
OK...
BTW, you got the 100th post on this topic, but this is the 100th reply.
Also, this is the 59599th topic ever posted on the forums. (Randomness.
)
Offline
scimonster wrote:
Hardmath123 wrote:
scimonster wrote:
?Dictionary pronunciation guide.
OK...
![]()
BTW, you got the 100th post on this topic, but this is the 100th reply.Also, this is the 59599th topic ever posted on the forums. (Randomness.
)
Okaaaaaaaaaaaaaaaaay
Anyway moving on
Is it going to ask a question like my (simple) calculator
Or is it actually going to have graphics ?
Offline
I would do it but you have tons of collab team members already.
Offline
Since no one wants to do the postfix stuff, how about this:
Break input into list "input"
Until all parentheses are dealt with:
Scan from beginning of "input" for "("
Scan from beginning of "input" for ")"
Add locations of these two parentheses in input list to list "parentheses_locations"
Until finished all locations in "parentheses_locations," start and end (innermost parentheses)
Evaluate items in "input" list between"parentheses_locations"
Replace items in "input" list with new value.
Display valueOffline
amcerbu wrote:
Since no one wants to do the postfix stuff, how about this:
Code:
Break input into list "input" Until all parentheses are dealt with: Scan from beginning of "input" for "(" Scan from beginning of "input" for ")" Add locations of these two parentheses in input list to list "parentheses_locations" Until finished all locations in "parentheses_locations," start and end (innermost parentheses) Evaluate items in "input" list between"parentheses_locations" Replace items in "input" list with new value. Display value
Hmmmmm...
Scratch doesn't have any blocks for scanning inputs. But, we could store the inputs in a list...
When I receive 'input'
Set counter to [1]
repeat 'length of [input]'
add letter [counter] of [input] to inputlist
change counter by 1
Offline
Necromaster wrote:
amcerbu wrote:
Since no one wants to do the postfix stuff, how about this:
Hmmmmm...
Scratch doesn't have any blocks for scanning inputs. But, we could store the inputs in a list...
When I receive 'input'
Set counter to [1]
repeat 'length of [input]'
add letter [counter] of [input] to inputlist
change counter by 1
Sorry if that wasn't clear. That step was supposed to be represented by "break input into list "input."" This is a very rough draft. The actual program would require several temporary variables for scanning first the input, then the lists. I think we should strive to make this 0s1s, so in fact, no broadcasts required.
Last edited by amcerbu (2011-04-04 17:27:44)
Offline
It's funny, I'm doing the same thing, just by myself. Sigma Alpha
Offline
I made a graphing calculator-type thing myself which, while slow, can compute almost any equation with input x.
Here it is.
Offline
amcerbu wrote:
Necromaster wrote:
amcerbu wrote:
Since no one wants to do the postfix stuff, how about this:
Hmmmmm...
Scratch doesn't have any blocks for scanning inputs. But, we could store the inputs in a list...
When I receive 'input'
Set counter to [1]
repeat 'length of [input]'
add letter [counter] of [input] to inputlist
change counter by 1Sorry if that wasn't clear. That step was supposed to be represented by "break input into list "input."" This is a very rough draft. The actual program would require several temporary variables for scanning first the input, then the lists. I think we should strive to make this 0s1s, so in fact, no broadcasts required.
Ohkay... 0s1s. Not too hard and much cleaner and faster.
Offline
Offline
Necromaster wrote:
amcerbu wrote:
Necromaster wrote:
Hmmmmm...
Scratch doesn't have any blocks for scanning inputs. But, we could store the inputs in a list...
When I receive 'input'
Set counter to [1]
repeat 'length of [input]'
add letter [counter] of [input] to inputlist
change counter by 1Sorry if that wasn't clear. That step was supposed to be represented by "break input into list "input."" This is a very rough draft. The actual program would require several temporary variables for scanning first the input, then the lists. I think we should strive to make this 0s1s, so in fact, no broadcasts required.
Ohkay... 0s1s. Not too hard and much cleaner and faster.
![]()
I like the list idea, but this means we have to start over. I guess it's ok, we haven't done much anyway
Offline
Are you sure you don't need any button sprites?
Offline
Well, we already have applejack for all graphics
, you can ask him if he needs help.
Offline
Hardmath123 wrote:
https://lh3.googleusercontent.com/i50S0 … OGVSw=s512https://lh5.googleusercontent.com/eMDBK … S6_Nw=s512https://lh5.googleusercontent.com/jAyuL … CPfuA=s512
Tell me if you can see the above image.
Yes, but it is too long for a sig.
Offline
scimonster wrote:
Hardmath123 wrote:
https://lh3.googleusercontent.com/i50S0 … OGVSw=s512https://lh5.googleusercontent.com/eMDBK … S6_Nw=s512https://lh5.googleusercontent.com/jAyuL … CPfuA=s512
Tell me if you can see the above image.Yes, but it is too long for a sig.
![]()
Really? The block lib banner's longer
P.S. I think you should stop working on the bracket opener. We've started to lean towards an engine which converts the whole thing into a list first, which means any non-list-based engine will be obsolete
Offline
Hardmath123 wrote:
scimonster wrote:
Hardmath123 wrote:
https://lh3.googleusercontent.com/i50S0 … OGVSw=s512https://lh5.googleusercontent.com/eMDBK … S6_Nw=s512https://lh5.googleusercontent.com/jAyuL … CPfuA=s512
Tell me if you can see the above image.Yes, but it is too long for a sig.
![]()
Really? The block lib banner's longer
![]()
P.S. I think you should stop working on the bracket opener. We've started to lean towards an engine which converts the whole thing into a list first, which means any non-list-based engine will be obsolete![]()
OK. It's the text that's too long for a sig.
Offline
scimonster wrote:
Hardmath123 wrote:
scimonster wrote:
Yes, but it is too long for a sig.![]()
Really? The block lib banner's longer
![]()
P.S. I think you should stop working on the bracket opener. We've started to lean towards an engine which converts the whole thing into a list first, which means any non-list-based engine will be obsolete![]()
OK. It's the text that's too long for a sig.
I thought BBCode got eliminated?
Offline
Hardmath123 wrote:
scimonster wrote:
Hardmath123 wrote:
Really? The block lib banner's longer![]()
P.S. I think you should stop working on the bracket opener. We've started to lean towards an engine which converts the whole thing into a list first, which means any non-list-based engine will be obsolete![]()
OK. It's the text that's too long for a sig.
I thought BBCode got eliminated?
No.
ONTOPIC: So I should cancel what I'm doing now?
Offline
Yeah
I'll have to delete the setup engine and my work on the non-bracket solver. This better make life easier
Offline
scimonster wrote:
Hardmath123 wrote:
scimonster wrote:
OK. It's the text that's too long for a sig.I thought BBCode got eliminated?
No.
*gasp* you're right!
Offline
You know what we forgot in the setup engine? × and ÷
Offline
scimonster wrote:
You know what we forgot in the setup engine? × and ÷
![]()
Who uses those? The standard ones are actually * and /.
How are we gonna do factorials. I made a factorial block (in the block library), but that won't work here.
Offline
Hardmath123 wrote:
scimonster wrote:
You know what we forgot in the setup engine? × and ÷
![]()
Who uses those? The standard ones are actually * and /.
How are we gonna do factorials. I made a factorial block (in the block library), but that won't work here.
But they get used anyways.
I do not know. I suppose with a repeat method...
set [count] to [0] set [factorial] to [0] repeat (number) change [count] by (1) set [factorial] to ((factorial) * (count))
Offline