Extend your own programming language [email protected] UP3VCZͷษڧձͰ.JO3VCZͱ͍͏খ͞ͳ3VCZΛ࡞ΔຊΛಡΜͰ͍·͢ɻ .JO3VCZඇৗʹখ͘͞վ͕؆୯Ͱ͢ɻࠓ.JO3VCZΛվͯࣗ͠ ༻ͷݴޠΛ࡞Γ·͢ɻ3VCZͰ࣮ݱ͕͔ͬͨ͠ػೳɺ࣮ߦίϯςΩ ετͷӬଓԽϓϩηεؒͷҠಈͳͲΛ࣮͢ΔΑʂ
Agenda About Me MinRuby Binary Operator, Builtin Function ⭐ Tail Call Optimization ⭐⭐ Linda eval / Process Migration ⭐⭐⭐ ࢲʹ͍ͭͯͨ͋͠ͱɺ.JO3VCZΛஈ֊ʹ͚ͯվ͠·͢ɻ࠷ ऴతʹɺҾΛධՁ͠ͳ͍ؔݺͼग़͠ʢʁʣͱϓϩηεͷҠૹΛ ࣮ͯ͠ɺ-JOEBͷFWBMΛ࡞Γ·͢ɻ⭐ ͠͞
Learning Ruby by Making Ruby by @mametter ԕ౻͞Μͷ3VCZͰͭ͘Δ3VCZɻϥϜμϊʔτͰങ͑·͢ʂ 3VCZΛ࡞Γͳ͕Β3VCZΛֶͿɺͪΐͬͱมΘͬͨೖॻɻ ͜ͷຊͷதͰ࡞Δͷ͕.JO3VCZͰ͢ɻిͷ࣮͔Β͡Ίͯ ذมɺؔͳͲΛ࡞Γͳ͕ΒΠϯλϓϦλΛͤ͞·͢
MinRuby A small language that extracts particularly important language functions in Ruby ʮ3VCZͷதͰಛʹॏཁͳݴޠػೳ͚ͩΛநग़ͨ͠খ͞ͳݴޠʯ ҉هͰ͖Δ͘Β͍খ͍͚͞ͲɺࣗࣗΛॻ͚Δ͘Β͍ʹେ ͖͍ɻ͔͍͍ͬ͜ɻ (Ruby Ruby p.iii)
Implementation Use ripper for parsing Convert ripper's output into MinRuby AST evaluate() function evaluates it ࣮ͷಛɻߏจղੳ3JQQFSʹ͍ͤͯΔɻ3JQQFSͷग़ྗ Λ؆ུԽͯ͠.JO3VCZͷ"CTUSBDU4ZOUBY5SFFʹม͢Δɻ "45ΛධՁ͢ΔFWBMVBUF ͕ؔΠϯλϓϦλͷਖ਼ମɻ 5SFF8BMLJOH*OUFSQSFUFS
Language Specification if, while Integer, String Hash, Array variable no classes, no method calls .JO3VCZࣗΛ࡞Δͷʹඞཁͳ࠷খݶͷػೳʹ࢛ଇԋࢉͳͲ ΛՃͨ͠ͷ͕.JO3VCZͷݴޠ༷Ͱ͢ɻDMBTTϝιου ίʔϧͳͲ͋Γ·ͤΜɻʮ3VCZͷதͰಛʹॏཁͳݴޠػೳ ͚ͩΛநग़ͨ͠খ͞ͳݴޠʯͷখ͍͢͞͞͝ʂ
if ⭐ վ͍ͯͯ͠ؾ͍͚ͮͨͲɺFMTF۟ͷͳ͍JGจΤϥʔʹͳͬ ͯ͠·͍·͢ɻͦ͏͍͏ͷɺΠϯλϓϦλͷ࣮ʹඞཁͳ ͔ͬͨͷ͔ͶɻͰ͍͍ࣗͨͷͰ͍ͨ͠ɻ if false p "not reached" end p "done" % ruby interp.rb prog.rb Traceback (most recent call last): 3: from interp.rb:118:in `' 2: from interp.rb:33:in `evaluate' 1: from interp.rb:45:in `evaluate' interp.rb:4:in `evaluate': undefined method `[]' for nil:NilClass (NoMethodError)
syntax sugar ͜ͷೋͭͷεΫϦϓτFMTJGΛ͏έʔεͱΘͳ͍έʔεͰ ͕͢ɺͲͪΒͷ߹ಉ͡"45ʹม͞Ε·͢ɻ if a == 0 "IF" elsif a == 1 "ELSIF" else "ELSE" end if a == 0 "IF" else if a == 1 "ELSIF" else "ELSE" end end ["if", ["==", ["var_ref", "a"], ["lit", 0]], ["lit", "IF"], ["if", ["==", ["var_ref", "a"], ["lit", 1]], ["lit", "ELSIF"], ["lit", "ELSE"]]]
another solution JGFOEͷผͷղܾࡦ͕͋Γ·͢ɻઌ΄ͲཧੵʢʣΛ ࣮ͨ͠ͷͰɺDBTF USFF USFF<>ͱ͢Δ͜ͱͰɺͳʹ ͳ͍Λॲཧ͠ͳ͍࡞ઓ͋Γ·͢ɻ def evaluate(tree, genv, lenv) case tree && tree[0] when "lit" ...
tail call optimization ⭐⭐ fact.rb ͜Ε֊Λ࠶ؼͰ࣮ͨ͠εΫϦϓτͰ͢ɻճͷ࠶ؼ ݺͼग़͠ʹͳΔͱࢥ͍·͢ɻ͜ΕΛॲཧܥ෦Ͱϧʔϓʹม Ͱ͖Δͱ͔͍͍ͬ͜ΜͰ͢Αʂ def fact(n, v) if n == 1 v else fact(n-1, v * (n-1)) end end p fact(5000, 1)
stack level too deep def fact(n, v) if n == 1 v else fact(n-1, v * (n-1)) end end p fact(5000, 1) % ruby interp.rb fact.rb Traceback (most recent call last): 5241: from interp.rb:118:in `' 5240: from interp.rb:33:in `evaluate' 5239: from interp.rb:57:in `evaluate' 5238: from interp.rb:71:in `evaluate' 5237: from interp.rb:45:in `evaluate' 5236: from interp.rb:71:in `evaluate' 5235: from interp.rb:45:in `evaluate' 5234: from interp.rb:71:in `evaluate' ... 5229 levels... 4: from interp.rb:71:in `evaluate' 3: from interp.rb:45:in `evaluate' 2: from interp.rb:57:in `evaluate' 1: from interp.rb:12:in `evaluate' interp.rb:10:in `evaluate': stack level too deep (SystemStackError) ΄Βಈ͔ͳ͍Ͱ͠ΐɻ
when "func_call" args = [] i = 0 while tree[i + 2] args[i] = evaluate(tree[i + 2], genv, lenv) i = i + 1 end mhd = genv[tree[1]] if mhd[0] == "builtin" minruby_call(mhd[1], args) else new_lenv = {} params = mhd[1] i = 0 while params[i] new_lenv[params[i]] = args[i] i = i + 1 end evaluate(mhd[2], genv, new_lenv) end evaluate arguments prepare new_lenv evaluate body "func_call" GVOD@DBMMؔݺͼग़͠Ͱ͢ɻ࣮ҾΛܭࢉ͠ɺԾҾͱ ࣮ҾΛηοτͨ͠ϋογϡOFX@MFOWΛ࡞Γ·͢ɻ࠷ޙʹؔ ͷຊମΛFWBMVBUF ͠·͢ɻ
mark_tail() ෳจͷඌͷࢬΛ୳ࡧʢϚʔΫʣɺJGͷೋͭͷࢬΛ୳ࡧɺͦ͠ ͯؔݺͼग़͠ʹग़ձͬͨΒGVOD@DBMMΛUBJMʹॻ͖͑· ͢ɻ def mark_tail(tree, genv) case tree && tree[0] when "stmts" mark_tail(tree[-1], genv) when "if" mark_tail(tree[2], genv) mark_tail(tree[3], genv) when "func_call" mhd = genv[tree[1]] if mhd == nil || mhd[0] == "user_defined" tree[0] = "tail" end end end tail of statements ذͷೋͭͷࢬΛ୳ࡧ set "tail" two branches of if
Linda operations out, in, rd write, take, read (in Rinda) eval not implemented (in Rinda) -JOEBͷͭͷૢ࡞ͱɺPVU
JO
SE
FWBMͰ͢ɻ࠷ॳͷࡾͭ3JOEB Ͱ࣮͞Ε͍ͯͯ·͢ɻૢ࡞ͷ໊લΘ͔Γ͘͢มߋ͠·ͨ͠ɻ ͍͠ͷFWBMͰ͢ɻ͜ΕͲ͏ʹ࣮Ͱ͖·ͤΜͰͨ͠ɻʢͪͳ ΈʹSJOEB@FWBMͱ͍͏αϒηοτ͋Γ·͢ɻʣ
Linda eval eval() creates processes for each argument -JOEBͷFWBMϓϩηεΛੜ͢ΔͨΊͷૢ࡞Ͱ͢ɻͭͷҾ ͱͯ͠ϦςϥϧɺมɺҾ͖ࢉɺؔݺͼग़͠Λ༩͍͑ͯ ·͢ɻFWBMΛݺͿલʹ͜ΕΒΛܭࢉ͠·ͤΜʂʂ eval("nq", size, n - 1, nq(size, n - 1))
Linda eval eval() creates processes for each argument collect the results and write a tuple ҾͷܭࢉͷͨΊʹ৽͍͠ϓϩηε͕ੜ͞Ε·͢ɻͭ·Γ৽͍͠ ϓϩηεͰҾΛܭࢉ͢Δͱ͍͏͜ͱͰ͢ɻFWBMΛݺͿଆͰҾΛ ධՁ͍͚ͯ͠·ͤΜɻશͯͷ݁ՌΛूΊͯɺλϓϧΛҰͭॻ͖·͢ɻ ͜ͷλϓϧΛͭ͜ͱͰϓϩηεͷऴྃΛͭ͜ͱ͕Ͱ͖·͢ɻ eval("nq", # fork { "nq" } size, # fork { size } n - 1, # fork { n - 1 } nq(size, n - 1)) # fork { nq(size, n - 1)} # fork { wait all process; # then put a tuple # write("nq", size, n - 1, nq(size, n - 1)) }
Linda eval / Process migration ⭐⭐⭐ "func_call" without evaluating parameters (lazy evaluation??) hard to implement in Ruby because of special behavior Process Migration Dump the context, transfer, and load it. -JOEB FWBMΛ࣮͢ΔͨΊʹೋͭͷ͕͋Γ·͢ɻҾΛධՁ͠ ͳ͍ಛผͳGVOD@DBMM͕ඞཁɻͰ͜͏͍͏ৼΔ͍Λ3VCZͰ࡞Δ ͷࠔͳΜͰ͢Αɻ͋ͱϓϩηεͷҠૹɻ͜ΕίϯςΩετΛ γϦΞϥΠζͯ͠సૹͯ͠ಡΈ͢ͷ͕Ͱ͖Ε͍͍ɻ
simple server FWBMΛ༻ͨ͠αʔόʔ͜Μͳ෩ʹॻ͖·͢ɻ def server() while true req = read("Q", nil, nil) value = do_it(req[2]) write("A", req[1], value) end end eval("s", server()) take("s", nil)
Summary I enjoyed the extending of MinRuby I want to make Agent system Ruby makes me feel great .JO3VCZΛ֦ுָͯ͠͠Έ·ͨ͠ɻ"HFOU TZTUFN·Ͱ࡞Γ ͍ͨʢ3VCZ,BJHJʹؒʹ߹͍·ͤΜͰͨ͠ʣɻ 3VCZΛΩϝΔͱؾ͍͍࣋ͪ
m_seki
seike460
philipschwarz
zerebom
codehex
ohakutsu
ojun9
h0r15h0
ryounasso
syukai
techouse
niftycorp
nijieinfra
destraynor
lemiorhan
colly
addyosmani
tmm1
keithpitt
productmarketing
frogandcode
aleyda
keavy
palkan
notwaldorf