Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.forth > #47061 > unrolled thread

fizzbuzz problem in forth

Back to article view | Back to comp.lang.forth

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.

Contents

  fizzbuzz problem in forth murphy.darin@gmail.com - 2016-05-12 16:17 -0700
    Re: fizzbuzz problem in forth Paul Rubin <no.email@nospam.invalid> - 2016-05-12 16:43 -0700
      Re: fizzbuzz problem in forth murphy.darin@gmail.com - 2016-05-12 17:22 -0700
      Re: fizzbuzz problem in forth anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2016-05-13 12:52 +0000
        Re: fizzbuzz problem in forth Paul Rubin <no.email@nospam.invalid> - 2016-05-16 15:09 -0700
          Re: fizzbuzz problem in forth anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2016-05-17 13:49 +0000
            Re: fizzbuzz problem in forth Paul Rubin <no.email@nospam.invalid> - 2016-05-17 11:14 -0700
              Re: fizzbuzz problem in forth anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2016-05-18 12:36 +0000
                Re: fizzbuzz problem in forth Paul Rubin <no.email@nospam.invalid> - 2016-05-20 21:55 -0700
                Re: fizzbuzz problem in forth julian.fondren@endurance.com - 2016-06-20 20:20 -0700
          Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-17 12:26 -0700
      Re: fizzbuzz problem in forth Gerry Jackson <gerry@jackson9000.fsnet.co.uk> - 2016-05-15 21:42 +0100
        Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-15 14:41 -0700
          Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-15 15:15 -0700
            Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-15 17:38 -0700
              Re: fizzbuzz problem in forth murphy.darin@gmail.com - 2016-05-15 19:01 -0700
                Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-15 19:51 -0700
                  Re: fizzbuzz problem in forth murphy.darin@gmail.com - 2016-05-15 20:48 -0700
                    Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-16 07:51 -0700
            Re: fizzbuzz problem in forth "WJ" <w_a_x_man@yahoo.com> - 2016-05-25 08:31 +0000
              Re: fizzbuzz problem in forth "WJ" <w_a_x_man@yahoo.com> - 2016-05-27 19:06 +0000
      Re: fizzbuzz problem in forth humptydumpty <ouatubi@gmail.com> - 2016-05-18 13:19 -0700
        Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-18 17:49 -0700
          Re: fizzbuzz problem in forth humptydumpty <ouatubi@gmail.com> - 2016-05-18 21:17 -0700
            Re: fizzbuzz problem in forth hughaguilar96@gmail.com - 2016-05-19 07:38 -0700
              Re: fizzbuzz problem in forth "Kerr Mudd-John" <admin@127.0.0.1> - 2016-06-20 19:24 -0100
                Re: fizzbuzz problem in forth endlessboomcapitalism@gmail.com - 2016-06-20 15:03 -0700
          Re: fizzbuzz problem in forth Albert van der Horst <albert@cherry.spenarnc.xs4all.nl> - 2016-05-19 13:07 +0000
            Re: fizzbuzz problem in forth Paul Rubin <no.email@nospam.invalid> - 2016-05-19 12:22 -0700
              Re: fizzbuzz problem in forth Albert van der Horst <albert@cherry.spenarnc.xs4all.nl> - 2016-05-20 23:51 +0000

Page 2 of 2 — ← Prev page 1 [2]

#47572

WJ wrote:

> hughaguilar96@gmail.com wrote:
> 
> > > Your solution is pretty good --- you do
> > > avoid using MOD which everybody else uses.
> > > 
> > > Your solution doesn't scale up very well
> > > though. What if the interview asks you to
> > > upgrade to FIZZ-BUZZ-BURP, with BURP being
> > > printed every 7th time? Bit masks were
> > > reasonable when they were (3*5=15) bits long
> > > --- not so reasonable when they are
> > > (3*5*7=105) bits long.
> > 
> > Here is my solution that also does not
> > involve MOD. Mine however can be
> > upgraded easily to support the
> > FIZZ-BUZZ-BURP problem.
> > 
> > 3 constant top-fizz
> > 5 constant top-buzz
> > 
> > : fizz-buzz ( -- )
> >     top-fizz top-buzz { fizz buzz -- }
> >     101 1 do
> >         -1 +to fizz
> >         -1 +to buzz
> >         cr
> >         fizz 0=  buzz 0=  or if  8 spaces  else  I 5 .r  3 spaces  then
> >         fizz 0= if  ." fizz "  top-fizz to fizz  then
> >         buzz 0= if  ." buzz "  top-buzz to buzz  then
> >         loop ;
> 
> 
> OCaml:
> 
> open List ;;
> 
> let rotate (x::xs) = xs @ [x] ;;
> 
> let init (n,str) = Array.to_list (Array.make (n - 1) "") @ [str] ;;
> 
> let stuff =
>   ref (map init [3,"fizz"; 5,"buzz"; 7,"hum"; 11,"thrum"; 13,"yelp"]) ;;
> 
> for i = 1 to 100 do
>   let s = String.concat "" (map hd !stuff) in
>   if "" = s then print_int i else print_string s ;
>   print_newline () ;
>   stuff := map rotate !stuff
> done ;;
> 
> 1
> 2
> fizz
> 4
> buzz
> fizz
> hum
> 8
> fizz
> buzz
> thrum
> fizz
> yelp
> hum
> fizzbuzz
> 16
> 17
> fizz
> 19
> buzz
> fizzhum
> thrum
> 23
> fizz
> buzz
> yelp
> fizz
> hum
> 29
> fizzbuzz
> 31
> 32
> fizzthrum
> 34
> buzzhum
> fizz
> 37
> 38
> fizzyelp
> buzz
> 41
> fizzhum
> 43
> thrum
> fizzbuzz
> 46
> 47
> fizz
> hum
> buzz
> fizz
> yelp
> 53
> fizz
> buzzthrum
> hum
> fizz
> 58
> 59
> fizzbuzz
> 61
> 62
> fizzhum
> 64
> buzzyelp
> fizzthrum
> 67
> 68
> fizz
> buzzhum
> 71
> fizz
> 73
> 74
> fizzbuzz
> 76
> humthrum
> fizzyelp
> 79
> buzz
> fizz
> 82
> 83
> fizzhum
> buzz
> 86
> fizz
> thrum
> 89
> fizzbuzz
> humyelp
> 92
> fizz
> 94
> buzz
> fizz
> 97
> hum
> fizzthrum
> buzz

Simply using mod:

let stuff = [3,"fizz"; 5,"buzz"; 7,"hum"; 11,"thrum"; 13,"yelp"] ;;

let value i (n, str) = if 0 = i mod n then str else "" ;;

for i = 1 to 100 do
  let s = String.concat "" (List.map (value i) stuff) in
  if "" = s then print_int i else print_string s ;
  print_newline () ;
done ;;

-- 
For two years ... he was held in solitary confinement in the Toronto West
Detention Centre, on the pretext that he is a threat to national security....
[A] court in Mannheim sentenced him to five years imprisonment for the crime of
"popular incitement" under Germany's notorious "Holocaust denial" statute.
http://www.revisionists.com/revisionists/zundel.html

[toc] | [prev] | [next] | [standalone]

#47284

On Friday, May 13, 2016 at 2:43:29 AM UTC+3, Paul Rubin wrote:
>  writes:
> > I know it's probaby very sloppy and wasteful, but just finised reading
> > chapter 5 of "Starting forth" and haven't gotten factoring
> > (distilling) down yet, but I will improve! Take care now.
> 
> You did fine.  That fizzbuzz problem attracts so many solutions not
> because it's difficult, but because it has annoying edges that draw
> people irresistably to look for ways to smooth them down.
> 
> http://dave.fayr.am/posts/2012-10-4-finding-fizzbuzz.html
> (not Forth related) expands on that thought.

Hi!
I could not resist to contribute to this Stone Soup :-)

: fb        ( n -- )  
        0
        over 3 mod 0= IF ." fizz" 1+ THEN
        over 5 mod 0= IF ." buzz" 1+ THEN
        IF drop ELSE . THEN 
;
:noname 20 1 DO I fb cr LOOP ; execute .s

Have a nice day,
humptydumpty

[toc] | [prev] | [next] | [standalone]

#47287

On Wednesday, May 18, 2016 at 1:19:55 PM UTC-7, humptydumpty wrote:
> On Friday, May 13, 2016 at 2:43:29 AM UTC+3, Paul Rubin wrote:
> >  writes:
> > > I know it's probaby very sloppy and wasteful, but just finised reading
> > > chapter 5 of "Starting forth" and haven't gotten factoring
> > > (distilling) down yet, but I will improve! Take care now.
> > 
> > You did fine.  That fizzbuzz problem attracts so many solutions not
> > because it's difficult, but because it has annoying edges that draw
> > people irresistably to look for ways to smooth them down.
> > 
> > http://dave.fayr.am/posts/2012-10-4-finding-fizzbuzz.html
> > (not Forth related) expands on that thought.
> 
> Hi!
> I could not resist to contribute to this Stone Soup :-)
> 
> : fb        ( n -- )  
>         0
>         over 3 mod 0= IF ." fizz" 1+ THEN
>         over 5 mod 0= IF ." buzz" 1+ THEN
>         IF drop ELSE . THEN 
> ;
> :noname 20 1 DO I fb cr LOOP ; execute .s
> 
> Have a nice day,
> humptydumpty

Your solution is the simplest and most readable so far.

Here is Paul Rubin's solution again, but with your display-count, which may be more readable that OR'ing flags:

: ctype ( str -- ) 
    count type ;

: fout ( display-cnt n denominator str -- flag )        
    >r
    mod 0= if  r@ ctype  1+  then 
    rdrop ;
    
: fb ( n -- ) 
    0                       \ -- display-cnt
    over 3 c" fizz " fout    
    over 5 c" buzz " fout    
    if  drop  else  .  then ;
    
: test ( -- )    
    cr
    20 1 do  I fb cr  loop ;

I factored out the common code and put it in FOUT --- whether that actually improves readability or not, is dubious.

[toc] | [prev] | [next] | [standalone]

#47295

On Thursday, May 19, 2016 at 3:49:59 AM UTC+3, hughag...@gmail.com wrote:
> On Wednesday, May 18, 2016 at 1:19:55 PM UTC-7, humptydumpty wrote:
> > On Friday, May 13, 2016 at 2:43:29 AM UTC+3, Paul Rubin wrote:
> > >  writes:
> > > > I know it's probaby very sloppy and wasteful, but just finised reading
> > > > chapter 5 of "Starting forth" and haven't gotten factoring
> > > > (distilling) down yet, but I will improve! Take care now.
> > > 
> > > You did fine.  That fizzbuzz problem attracts so many solutions not
> > > because it's difficult, but because it has annoying edges that draw
> > > people irresistably to look for ways to smooth them down.
> > > 
> > > http://dave.fayr.am/posts/2012-10-4-finding-fizzbuzz.html
> > > (not Forth related) expands on that thought.
> > 
> > Hi!
> > I could not resist to contribute to this Stone Soup :-)
> > 
> > : fb        ( n -- )  
> >         0
> >         over 3 mod 0= IF ." fizz" 1+ THEN
> >         over 5 mod 0= IF ." buzz" 1+ THEN
> >         IF drop ELSE . THEN 
> > ;
> > :noname 20 1 DO I fb cr LOOP ; execute .s
> > 
> > Have a nice day,
> > humptydumpty
> 
> Your solution is the simplest and most readable so far.
> 
> Here is Paul Rubin's solution again, but with your display-count, which may be more readable that OR'ing flags:
> 
> : ctype ( str -- ) 
>     count type ;
> 
> : fout ( display-cnt n denominator str -- flag )        
>     >r
>     mod 0= if  r@ ctype  1+  then 
>     rdrop ;
>     
> : fb ( n -- ) 
>     0                       \ -- display-cnt
>     over 3 c" fizz " fout    
>     over 5 c" buzz " fout    
>     if  drop  else  .  then ;
>     
> : test ( -- )    
>     cr
>     20 1 do  I fb cr  loop ;
> 
> I factored out the common code and put it in FOUT --- whether that actually improves readability or not, is dubious.

Hi!

In time, I learned that, ideally, factoring should be done around
 a reusable concept, and if from context can I think what parameters
takes for input and output, much better then.

Have a nice day,
humptydumpty

[toc] | [prev] | [next] | [standalone]

#47309

On Wednesday, May 18, 2016 at 9:17:59 PM UTC-7, humptydumpty wrote:
> On Thursday, May 19, 2016 at 3:49:59 AM UTC+3, hughag...@gmail.com wrote:
> > I factored out the common code and put it in FOUT --- whether that actually improves readability or not, is dubious.
> 
> Hi!
> 
> In time, I learned that, ideally, factoring should be done around
>  a reusable concept, and if from context can I think what parameters
> takes for input and output, much better then.
> 
> Have a nice day,
> humptydumpty

I agree. Any good idea, if applied willy-nilly, becomes a bad idea.

Exercises such as Fizz-Buzz are somewhat useful for learning, but they are so short and simple that techniques such as factoring and OOP etc. are almost always gratuitous.

I would recommend that people learning Forth write nontrivial programs as soon as possible, preferably that do something interesting. My first-ever ANS-Forth program was LowDraw.4th that is now in the novice-package as an example program.

This thread was started by Gavino, who has yet to write even a trivial program in Forth. The guy has no follow-through whatsoever --- even with a two-minute attention-span, this Fizz-Buzz program could have been written.

Unfortunately, Fizz-Buzz wasn't in "Starting Forth" --- if it had been, Elizabeth Rather could have copied it from the book and posted it here on c.l.f. --- maybe next, Gavino will ask how to write a function called STARS that prints out a variable number of asterisks (if we tell Gavino that a STARS function is the first step toward writing a web browser and/or OS in 1% of the memory as usual, then he will immediately ask how STARS is written).

[toc] | [prev] | [next] | [standalone]

#48392

On Thu, 19 May 2016 13:38:31 -0100, <hughaguilar96@gmail.com> wrote:

> On Wednesday, May 18, 2016 at 9:17:59 PM UTC-7, humptydumpty wrote:
>> On Thursday, May 19, 2016 at 3:49:59 AM UTC+3, hughag...@gmail.com  
>> wrote:
>> > I factored out the common code and put it in FOUT --- whether that  
>> actually improves readability or not, is dubious.
>>
>> Hi!
>>
>> In time, I learned that, ideally, factoring should be done around
>>  a reusable concept, and if from context can I think what parameters
>> takes for input and output, much better then.
>>
>> Have a nice day,
>> humptydumpty
>
> I agree. Any good idea, if applied willy-nilly, becomes a bad idea.
>
> Exercises such as Fizz-Buzz are somewhat useful for learning, but they  
> are so short and simple that techniques such as factoring and OOP etc.  
> are almost always gratuitous.
>
> I would recommend that people learning Forth write nontrivial programs  
> as soon as possible, preferably that do something interesting. My  
> first-ever ANS-Forth program was LowDraw.4th that is now in the  
> novice-package as an example program.
>
> This thread was started by Gavino, who has yet to write even a trivial  
> program in Forth. The guy has no follow-through whatsoever --- even with  
> a two-minute attention-span, this Fizz-Buzz program could have been  
> written.
>


Ah. I'm late to this discussion, but I suspect he saw FizzBuzz being  
discussed in clax.

(it started there in mid? May)
I have a 63 byte solution, easily expandable for "bazz" , but limited to a  
count of 100 (2 digit display) - and also has a few starting assumptions.
Basically, the approach I used was to keep a count (initially down, but  
shaved a byte or 2 by doing it up from -x) for each Fizz/Buzz/Zapp.
It needs an extra 2 +n +strlen bytes to allow for "Flarp!" (i.e. to avoid  
the hardcoding of 4 for each FizzBuzz string).

[]

[toc] | [prev] | [next] | [standalone]

#48396

On Monday, June 20, 2016 at 3:21:35 PM UTC-4, Kerr Mudd-John wrote:
> On Thu, 19 May 2016 13:38:31 -0100, <hughaguilar96@gmail.com> wrote:
> 
> > On Wednesday, May 18, 2016 at 9:17:59 PM UTC-7, humptydumpty wrote:
> >> On Thursday, May 19, 2016 at 3:49:59 AM UTC+3, hughag...@gmail.com  
> >> wrote:
> >> > I factored out the common code and put it in FOUT --- whether that  
> >> actually improves readability or not, is dubious.
> >>
> >> Hi!
> >>
> >> In time, I learned that, ideally, factoring should be done around
> >>  a reusable concept, and if from context can I think what parameters
> >> takes for input and output, much better then.
> >>
> >> Have a nice day,
> >> humptydumpty
> >
> > I agree. Any good idea, if applied willy-nilly, becomes a bad idea.
> >
> > Exercises such as Fizz-Buzz are somewhat useful for learning, but they  
> > are so short and simple that techniques such as factoring and OOP etc.  
> > are almost always gratuitous.
> >
> > I would recommend that people learning Forth write nontrivial programs  
> > as soon as possible, preferably that do something interesting. My  
> > first-ever ANS-Forth program was LowDraw.4th that is now in the  
> > novice-package as an example program.
> >
> > This thread was started by Gavino, who has yet to write even a trivial  
> > program in Forth. The guy has no follow-through whatsoever --- even with  
> > a two-minute attention-span, this Fizz-Buzz program could have been  
> > written.
> >
> 
> 
> Ah. I'm late to this discussion, but I suspect he saw FizzBuzz being  
> discussed in clax.
> 
> (it started there in mid? May)
> I have a 63 byte solution, easily expandable for "bazz" , but limited to a  
> count of 100 (2 digit display) - and also has a few starting assumptions.
> Basically, the approach I used was to keep a count (initially down, but  
> shaved a byte or 2 by doing it up from -x) for each Fizz/Buzz/Zapp.
> It needs an extra 2 +n +strlen bytes to allow for "Flarp!" (i.e. to avoid  
> the hardcoding of 4 for each FizzBuzz string).
> 
> []

show the code!

trump all the way

[toc] | [prev] | [next] | [standalone]

#47305

On 2016-05-19, hughaguilar96@gmail.com <hughaguilar96@gmail.com> wrote:
> On Wednesday, May 18, 2016 at 1:19:55 PM UTC-7, humptydumpty wrote:
<SNIP>
>> Hi!
>> I could not resist to contribute to this Stone Soup :-)

I like the metaphore Stone Soup

>>
>> : fb        ( n -- )
>>         0
>>         over 3 mod 0= IF ." fizz" 1+ THEN
>>         over 5 mod 0= IF ." buzz" 1+ THEN
>>         IF drop ELSE . THEN
>> ;
>> :noname 20 1 DO I fb cr LOOP ; execute .s
>>
>> Have a nice day,
>> humptydumpty
>
> Your solution is the simplest and most readable so far.
>
> Here is Paul Rubin's solution again, but with your display-count,
> which may be more readable that OR'ing flags:
>
>: ctype ( str -- )
>     count type ;
>
>: fout ( display-cnt n denominator str -- flag )
>     >r
>     mod 0= if  r@ ctype  1+  then
>     rdrop ;
>
>: fb ( n -- )
>     0                       \ -- display-cnt
>     over 3 c" fizz " fout
>     over 5 c" buzz " fout
>     if  drop  else  .  then ;
>
>: test ( -- )
>     cr
>     20 1 do  I fb cr  loop ;
>
> I factored out the common code and put it in FOUT --- whether that
> actually improves readability or not, is dubious.

(Just two lines with more than 72 char's. You improve! )

I seem no longer be capable to program, unless the result is iron-clad
and object oriented.

If you may use X as a sentinel, one can consider the process
as a number of transformations to X applied in sequence.
This requires that we add the restriction that the sentinel is
separate, in our case X must not be zero.
This is an exception to the rule that arguments must be consumed.

Now we get this as my ideal code:
( WANT is a shopping list of words needed.)

\ -------------------------------------
\ Description: do WJ's FIZZBUZZ

( ISO) WANT 2@ 2,
( ciforth) WANT class $. " :I REGRESS TRUE $=

\ For X and Y: "x DIVIDES y"
\ Inline it as a premature optimisation.
\ For those preferring old fashioned comment: ( divider n -- flag)
:I | SWAP MOD 0= ;   \ Math: x|y means x divides y.
REGRESS   3 5 |   S: FALSE
REGRESS   3 9 |   S: TRUE

"" 0
class doer
   M: divider @ M;        ,
   M: silly-string 2@ M; 2,
endclass

\ Concentrate all arbitrary configuration data here:
"FIZZ " 2 doer obj1
"BUZZ " 3 doer obj2
REGRESS obj1 silly-string "FIZZ " $= S: TRUE
REGRESS obj1 divider S: 2

\ If X is divisable by `divider print the 'silly-string and leave ZERO,
\ else leave X.  Ignore zeroes.
\ For those preferring old fashioned comment ( X -- 0/X )
: doit   DUP 0= IF EXIT THEN
    divider OVER | IF silly-string $. 0 AND THEN ;
REGRESS obj1 17 doit S: 17
REGRESS obj1 18 doit S: 0
REGRESS obj1 0 doit S: 0

: test 21 1 DO I
    obj1 doit
    obj2 doit
    ?DUP IF . THEN LOOP ;
REGRESS test S:

\ -------------------------------------

This is what you get from loading this with REGRESS active:

\ --------------------------------------
  3 5 | S: FALSE \ PASSED
  3 9 | S: TRUE \ PASSED
obj1 silly-string "FIZZ " $= S: TRUE \ PASSED
obj1 divider S: 2 \ PASSED
obj1 17 doit S: 17 \ PASSED
FIZZ obj1 18 doit S: 0 \ PASSED
obj1 0 doit S: 0 \ PASSED
1 FIZZ BUZZ FIZZ 5 FIZZ 7 FIZZ BUZZ FIZZ 11 FIZZ 13 FIZZ BUZZ FIZZ 17 FIZZ 19 FIZZ test S: \ PASSED
\ --------------------------------------

\ Note: likely modifications to the program are in constant fields of objects.

\ Note: If you want to have more cases, register the objects into a list as
\ they  are defined, and loop over the list.

\ Note: The number of tools drawn in suggest that plain ISO is lacking,
\ who said that before (Hugh?)

Groetjes Albert

--
Albert van der Horst, UTRECHT,THE NETHERLANDS
Economic growth -- being exponential -- ultimately falters.
albert@spe&ar&c.xs4all.nl &=n http://home.hccnet.nl/a.w.m.van.der.horst

[toc] | [prev] | [next] | [standalone]

#47320

Albert van der Horst <albert@cherry.spenarnc.xs4all.nl> writes:
> I seem no longer be capable to program, unless the result is iron-clad
> and object oriented....
> class doer
>    M: divider @ M;        ,
>    M: silly-string 2@ M; 2,
> endclass
>...

Why stop there?

https://github.com/EnterpriseQualityCoding/FizzBuzzEnterpriseEdition

[toc] | [prev] | [next] | [standalone]

#47372

On 2016-05-19, Paul Rubin <no.email@nospam.invalid> wrote:
> Albert van der Horst <albert@cherry.spenarnc.xs4all.nl> writes:
>> I seem no longer be capable to program, unless the result is iron-clad
>> and object oriented....
>> class doer
>>    M: divider @ M;        ,
>>    M: silly-string 2@ M; 2,
>> endclass
>>...
>
> Why stop there?
>
> https://github.com/EnterpriseQualityCoding/FizzBuzzEnterpriseEdition

Awesome. It looks much like the code I had to maintain at the Dutch
tax office.
Does it actually work?

Groetjes Albert
--
Albert van der Horst, UTRECHT,THE NETHERLANDS
Economic growth -- being exponential -- ultimately falters.
albert@spe&ar&c.xs4all.nl &=n http://home.hccnet.nl/a.w.m.van.der.horst

[toc] | [prev] | [standalone]

Page 2 of 2 — ← Prev page 1 [2]

Back to top | Article view | comp.lang.forth

csiph-web