dino-

!!!!! ATTENTION !!!!!

This project has been permanently moved to Codeberg (haskell-symbols) and is no longer actively maintained on Github. Don't bother forking or getting source from here as it will not be updated.

Microsoft is not a friend of open-source and we do ourselves a disservice giving them this impressive power over our work.

MihailJP

\ This implements Euclidean algorithm in Forth
: gcd ( X Y )
	2dup <= if swap ( Y X ) then
	( X Y )
	begin
		tuck ( Y X Y )
		mod ( Y Z )
		dup ( Y Z Z )
	0= until ( Y Z )
	( Y 0 )