aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Time for an 2014 update…

Browse source
This commit is contained in:
Ingy döt Net 2014-01-17 05:32:22 +00:00
parent 372c577f83
commit 09687c4926
2520 changed files with 34227 additions and 7318 deletions
Download patch file Download diff file Expand all files Collapse all files

41
Task/Universal-Turing-machine/REXX/universal-turing-machine-1.rexx Normal file
View file

@ -0,0 +1,41 @@
/*REXX pgm executes a Turing machine based on initial state, tape, rules*/
state = 'q0' /*initial Turing machine state. */
term = 'qf' /*a state that is used for halt. */
blank = 'B' /*this character is a true blank.*/
call turing_rule 'q0 1 1 right q0' /*define a rule for the machine. */
call turing_rule 'q0 B 1 stay qf' /* " " " " " " */
call turing_init 1 1 1 /*initialize tape to string(s). */
call turing_machine /*go invoke the Turning machine. */
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────TURING_MACHINE subroutine───────────*/
turing_machine: !=1; bot=1; top=1 /*start at the tape location 1. */
say /*might as well show a blank line*/
do cycle=1 until state==term /*do Turing machine instructions.*/
do k=1 for rules /*process the Turning mach. rules*/
parse var rule.k rState rTape rWrite rMove rNext . /*pick pieces*/
if state\==rState | @.!\==rTape then iterate /*wrong rule?*/
@.!=rWrite /*right rule; write it ──► tape.*/
if rMove== 'left' then !=!-1 /*Move left? Then subtract one.*/
if rMove=='right' then !=!+1 /*Move right? Then add one.*/
bot=min(bot,!); top=max(top,!) /*find the tape bottom and top.*/
state=rNext /*use this for the next state. */
iterate cycle /*go process another instruction.*/
end /*k*/
say '***error!*** unknown state:' state; leave /*oops.*/
end /*cycle*/
$= /*start with empty string (tape).*/
do t=bot to top; _=@.t; if _==blank then _=' ' /*translate?*/
$=$ || pad || _ /*build chr by chr, maybe pad it.*/
end /*t*/ /* [↑] build the tape's contents.*/
if $='' then $= "[tape is blank.]" /*make an empty tape visible.*/
say 'Turning machine used' rules "rules in" cycle 'cycles, tape is:' $
return
/*──────────────────────────────────TURING_INIT subroutine──────────────*/
turing_init: @.=blank; parse arg x
do j=1 for words(x); @.j=word(x,j); end /*j*/
return
/*──────────────────────────────────TURING_RULE subroutine──────────────*/
turing_rule: if symbol('RULES')=="LIT" then rules=0; rules=rules+1
pad=left('',length(word(arg(1),2))\==1) /*used if any symbol's length>1.*/
rule.rules=arg(1); say right('rule' rules,20) "═══►" rule.rules
return

15
Task/Universal-Turing-machine/REXX/universal-turing-machine-2.rexx Normal file
View file

@ -0,0 +1,15 @@
/*REXX pgm executes a Turing machine based on initial state, tape, rules*/
state = 'a' /*initial Turing machine state. */
term = 'halt' /*a state that is used for halt. */
blank = 0 /*this character is a true blank.*/
call turing_rule 'a 0 1 right b' /*define a rule for the machine. */
call turing_rule 'a 1 1 left c' /* " " " " " " */
call turing_rule 'b 0 1 left a' /* " " " " " " */
call turing_rule 'b 1 1 right b' /* " " " " " " */
call turing_rule 'c 0 1 left b' /* " " " " " " */
call turing_rule 'c 1 1 stay halt' /* " " " " " " */
call turing_init /*initialize tape to string(s). */
call turing_machine /*go invoke the Turning machine. */
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────TURING_MACHINE subroutine───────────*/
turing_machine ∙∙∙

19
Task/Universal-Turing-machine/REXX/universal-turing-machine-3.rexx Normal file
View file

@ -0,0 +1,19 @@
/*REXX pgm executes a Turing machine based on initial state, tape, rules*/
state = 'A' /*initial Turing machine state. */
term = 'H' /*a state that is used for halt. */
blank = 0 /*this character is a true blank.*/
call turing_rule 'A 0 1 right B' /*define a rule for the machine. */
call turing_rule 'A 1 1 left C' /* " " " " " " */
call turing_rule 'B 0 1 right C' /* " " " " " " */
call turing_rule 'B 1 1 right B' /* " " " " " " */
call turing_rule 'C 0 1 right D' /* " " " " " " */
call turing_rule 'C 1 1 left E' /* " " " " " " */
call turing_rule 'D 0 1 left A' /* " " " " " " */
call turing_rule 'D 1 1 left D' /* " " " " " " */
call turing_rule 'E 0 1 stay H' /* " " " " " " */
call turing_rule 'E 1 1 left A' /* " " " " " " */
call turing_init /*initialize tape to string(s). */
call turing_machine /*go invoke the Turning machine. */
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────TURING_MACHINE subroutine───────────*/
turing_machine ∙∙∙

23
Task/Universal-Turing-machine/REXX/universal-turing-machine-4.rexx Normal file
View file

@ -0,0 +1,23 @@
/*REXX pgm executes a Turing machine based on initial state, tape, rules*/
state = 'A' /*initial Turing machine state. */
term = 'halt' /*a state that is used for halt. */
blank = 0 /*this character is a true blank.*/
call turing_rule 'A 1 1 right A' /*define a rule for the machine. */
call turing_rule 'A 2 3 right B' /* " " " " " " */
call turing_rule 'A 0 0 left E' /* " " " " " " */
call turing_rule 'B 1 1 right B' /* " " " " " " */
call turing_rule 'B 2 2 right B' /* " " " " " " */
call turing_rule 'B 0 0 left C' /* " " " " " " */
call turing_rule 'C 1 2 left D' /* " " " " " " */
call turing_rule 'C 2 2 left C' /* " " " " " " */
call turing_rule 'C 3 2 left E' /* " " " " " " */
call turing_rule 'D 1 1 left D' /* " " " " " " */
call turing_rule 'D 2 2 left D' /* " " " " " " */
call turing_rule 'D 3 1 right A' /* " " " " " " */
call turing_rule 'E 1 1 left E' /* " " " " " " */
call turing_rule 'E 0 0 right halt' /* " " " " " " */
call turing_init 1 2 2 1 2 2 1 2 1 2 1 2 1 2 /*init. tape to string(s). */
call turing_machine /*go invoke the Turning machine. */
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────TURING_MACHINE subroutine───────────*/
turing_machine ∙∙∙