Simply ScalaCaptcha security check simplyscala.com is for sale Please prove you're not a robot View Price Processing
Native Clientã®ä»•çµ„ã¿ã¯ã©ã†ãªã£ã¦ã„ã‚‹ã®ã‹ï¼Ÿ - ã‚„ãã†ã‚‰ãŠâˆ’よã£ã¡ã‚ƒã‚“イカã¯ã—ã°ã‚‰ãè²·ã‚ãšã«iPhoneã ã‘ã«æ³¨åŠ›ã™ã‚‹ç”·
GoogleãŒã€Webブラウザ上ã§ãƒã‚¤ãƒ†ã‚£ãƒ–ãƒã‚¤ãƒŠãƒªã‚³ãƒ¼ãƒ‰ã‚’実行ã™ã‚‹ã€ŒNative Clientã€ã‚’公開ã—ãŸã€‚ Native Client http://code.google.com/p/nativeclient/ Google Earth,Quakeãªã©ãŒã™ã§ã«å‹•ã„ã¦ã„るよã†ã 。 ã“ã‚Œã¯ã™ã”ã„ï¼ãƒ–ラウザ上ã§X86ãƒã‚¤ãƒŠãƒªã‚’å‹•ã‹ã™ã€ŒNative Client〠http://www.moongift.jp/2008/12/native_client/ サンドボックスã§å®‰å…¨æ€§ç¢ºä¿ã€ã‚ªãƒ¼ãƒãƒ¼ãƒ˜ãƒƒãƒ‰5ï¼… ブラウザã§x86ãƒã‚¤ãƒŠãƒªå®Ÿè¡Œã€ã‚°ãƒ¼ã‚°ãƒ«ãŒæ–°æŠ€è¡“ http://www.atmarkit.co.jp/news/200812/09/nacl.html ã‚ã¨ã€ã‚µãƒ³ãƒ—ルã®life.ccã«SDL_surfaceã¨æ›¸ã„ã¦ã‚ã‚‹ã®ã§SDLã®æç”»ã¾ã‚ã‚ŠãŒæ—¢ã«å‹•ã„ã¦ã„ã‚‹ã®ã ã‚ã†ã‹ã‚‰ã€ä»Šå¾Œã€ãŸãã•ã‚“ã®ã‚¢ãƒ—リãŒN
ã¯ã¦ãªãƒ–ãƒã‚° | 無料ブãƒã‚°ã‚’作æˆã—よã†
織田信長 ã¼ã¡ã¼ã¡ã€å…ƒæ°—ã«ã‚„ã£ã¦ã„ã¾ã™ã€‚å°‘ã—è–¬ã«ã‚‚慣れãŸ...ã‚“ã‹ãªã。相変ã‚らãšé£Ÿã¹ã‚‰ã‚Œãªã„ã‘ã©ã€‚æœã€æŒ‡ãŒã“ã‚ã°ã£ã¦æ–‡å—ãªã‚“ã¦å…¥åŠ›ã§ããªã‹ã£ãŸã‘ã©ã€ãã‚Œã¯ã»ã¼ãªããªã£ãŸã€‚関節もã©ã“ã‚‚ç—›ããªã„。薬効ã„ã¦ããŸã‚“ã‚„ã‚ãªã€‚ ã§ã€ãƒ–ãƒã‚°ã‚’書ã“ã†ã¨è¨€ã†æ°—ãŒã¾ãŸèµ·ãã¦ããŸã€‚ …
brainfuck interpreter in Coq - ã¾ã‚ã‚ã‚‚
Haskell ã€Erlang ã®æ¬¡ã®ãƒ–ーム㯠Coq ã«é•ã„ã‚ã‚Šã¾ã›ã‚“。ã¨ã‚Šã‚ãˆãšåŸºæœ¬ã¨ã„ã†ã“ã¨ã§ã€Coq ã§ã²ãã‚Šã®ãªã„ brainfuck インタプリタを書ã„ã¦ã¿ã¾ã—ãŸã€‚動作例。Coq ã®ã‚³ãƒ¼ãƒ‰ãŒè‰²ã¥ã‘ã§ããªã„ã¨ã¯ä½•äº‹ã‹ã€‚ Eval compute in (finite_execute " +++++++++[>++++++++>+++++++++++>+++++<<< -]>.>++.+++++++..+++.>-.------------.<++ ++++++.--------.+++.------.--------.>+. " "" 500). = "Hello, world!"%string : string 残念ãªãŒã‚‰ (?) Coq ã§ã¯åœæ¢æ€§ãŒä¿éšœã•ã‚ŒãŸé–¢æ•°ã—ã‹å®šç¾©ã§ãã¾ã›ã‚“。ã“ã“ã§ã¯æœ€å¤§è©•ä¾¡ã‚¹ãƒ†ãƒƒãƒ—を指定ã—ãªã„ã¨ã„ã‘ãªã„ã¨ã„ã†ä»•æ§˜ã«ã—ã¦ã”ã¾ã‹ã—ã¦ã„ã¾ã™ (引数㮠50
Grass 処ç†ç³» - ã¾ã‚ã‚ã‚‚
プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªž Grass ã® Ruby 1.9 ã«ã‚ˆã‚‹å‡¦ç†ç³»ã§ã™ã€‚ # parse A, L = Struct.new(:m, :n), Struct.new(:code) code = File.read(ARGV[0]) code = code.gsub("\uFF37", "W").gsub("\uFF57", "w").gsub("\uFF56", "v") code = code.gsub(/[^wWv]/, "") code = code[/w.*\z/m].split(/v/).map do |sub| sub = sub.scan(/w+|W+/) arity = sub.first[0] == "w" ? sub.shift.size : 0 sub = sub.each_slice(2).map {|n, m| A[n.size - 1, m.size - 1]
YARV(Yet Another RubyVM)アーã‚テクãƒãƒ£
ã“ã‚Œã¯ï¼Ÿ Compiler (compile.h, compile.c) VM Generator (rb/insns2vm.rb, insns.def)命令記述 VM (Virtual Machine, vm.h, vm.c)レジスタ スタックフレームメソッドãƒãƒ¼ã‚«ãƒ«ãƒ•ãƒ¬ãƒ¼ãƒ ブãƒãƒƒã‚¯ãƒãƒ¼ã‚«ãƒ«ãƒ•ãƒ¬ãƒ¼ãƒ クラスフレームフレームデザインã«ã¤ã„ã¦ã®è£œè¶³ メソッド呼ã³å‡ºã—ã«ã¤ã„㦠例外例外テーブル rescue ensure break, return（ブãƒãƒƒã‚¯ä¸ï¼‰ã€retry 定数ã®æ¤œç´¢å®šæ•°æ¤œç´¢ãƒ‘ス 最é©åŒ–手法threaded code Peephole optimization inline method cache inline constant cache ブãƒãƒƒã‚¯ã¨ Proc オブジェクトã®åˆ†é›¢ 特化命令 命令èžåˆ オペランドèžåˆ stack caching JIT Compile
ヒビルテ(2008-07-03)
日々ã®æµè»¢ トラックãƒãƒƒã‚¯ã‚¹ãƒ‘ムを大é‡ã«å–°ã‚‰ã£ãŸã®ã§ã€ãƒˆãƒ©ãƒƒã‚¯ãƒãƒƒã‚¯ã‚’一時的ã«ç„¡åŠ¹ã«ã—ã¦ã„ã¾ã™ã€‚ λ. A brainf*ck interpreter in Erlang HelloWorld を書ã„ãŸã®ã§ã€æ¬¡ã¯ brainf*ck ã®ã‚¤ãƒ³ã‚¿ãƒ—リタã§ã‚‚。 -module(brainfuck). -export([brainfuck/1]). brainfuck(Src) -> Prog=parse(Src), seq(Prog, {[], [0]}). parse(X) -> {Y,_} = parse(X, []), Y. parse([], Acc) -> {lists:reverse(Acc), []}; parse([H|T], Acc) -> case H of $] -> {lists:reverse(Acc), T}; $> -> parse(T, ['>'|Acc]);
Haskell Hackathon ã‚„ã‚ŠãŸã„ãï¼ - yukobaã®æ—¥è¨˜
å‰å›žã® Scheme Hackathon ã®æ™‚ã«ã€æ¬¡ã¯ "Haskell Hackathon" ã‚„ã‚ŠãŸã„ãã€ã¨ã„ã†è©±ãŒå‡ºã¾ã—ãŸã€‚ã¯ã£ãり言ã£ã¦ã€åƒ•ã¯ã€ã€ŒHaskell ã½ã‹ã€œã‚“ã€ã®äººã§ã™ã€‚モナドãŒã‚ã‹ã‚Šã¾ã›ã‚“。Scheme ã¯å®Ÿè£…ã™ã‚‹ã“ã¨ã§ã€å°‘ã—ç†è§£ã—ã¾ã—ãŸã€‚ãã£ã¨ã€Haskell も処ç†ç³»ä½œã£ãŸã‚‰ã€ç†è§£ã§ãã‚‹ã®ã§ã¯ãªã„ã‹ã¨æœŸå¾…ã—ã¦ã„ã¾ã™ï¼ï¼ˆãŠãƒ ã¨ã„ã†ã‚ã‘ã§ã€Haskell Hackathonã¯ã€Œ12時間㧠Haskell ã®å‡¦ç†ç³»ã‚’実装ã—よã†ï¼ã€ã¨ã„ã†ã‚¤ãƒ™ãƒ³ãƒˆã§ã™ã€‚ 詳細ã¯ã“ã‚“ãªæ„Ÿã˜ã€‚ å‚åŠ è€…å…¨å“¡ã€Haskell ã®å‡¦ç†ç³»å®Ÿè£…ï¼ ä¼šå ´ã¯ã€é–¢æ±ã€é–¢è¥¿ã€åå¤å±‹ã§ã™ã€‚Ustream ã‹ Skype Video ãªã©ã§ä¼šå ´ã‚’ã¤ãªãŽã¾ã™ã€‚é–¢æ±ã¯ã€ã‚µã‚¤ãƒœã‚¦ã‚ºãƒ»ãƒ©ãƒœã€é–¢è¥¿ã¯æ ªå¼ä¼šç¤¾ã‚°ãƒƒãƒ‡ã‚£ã€åå¤å±‹ã¯æ¥æ –å·é›»ç®—ã§ã™ã€‚ 時間ã¯ã€ï¼“ï¼ï¼‘土曜日ã®AM11時〜PM11時ã§ã™ã€‚ 実装言語ã¯ã€ä¸å•ã€‚僕ã®çµŒé¨“ã‹ã‚‰è¨€
ヒビルテ(2007-12-07)
日々ã®æµè»¢ トラックãƒãƒƒã‚¯ã‚¹ãƒ‘ムを大é‡ã«å–°ã‚‰ã£ãŸã®ã§ã€ãƒˆãƒ©ãƒƒã‚¯ãƒãƒƒã‚¯ã‚’一時的ã«ç„¡åŠ¹ã«ã—ã¦ã„ã¾ã™ã€‚ λ. A brainf*ck interpreter in Prolog ãµã¨ã€ç¾å®Ÿé€ƒé¿ã«Prologã§Brainf*ckã®ç°¡å˜ãªã‚¤ãƒ³ã‚¿ãƒ—リタを書ã„ã¦ã¿ãŸã€‚ brainfuck(Src) :- bf(Prog, Src, []), !, seq(Prog, []*[0], _). bf([]) --> []. bf([X|Y]) --> bf1(X), {!}, bf(Y). bf(X) --> [_], bf(X). bf1('>') --> ">". bf1('<') --> "<". bf1('+') --> "+". bf1('-') --> "-". bf1('.') --> ".". bf1(',') --> ",". bf1(w(X)) --> "[", bf(X), "]".
Hugs 98
Note: Hugs is no longer in development. The content on these pages is provided as a historical reference and as a resource for those who are still interested in experimenting with or otherwise exploring the system. Hugs 98 is a functional programming system based on Haskell 98, the de facto standard for non-strict functional programming languages. Hugs 98 provides an almost complete implementation
c-repl
Update (March 2013): C-REPL was a neat hack, but a more principled implementation of the same goal exists in Cling. Many programming languages come with a REPL (read-eval-print loop), which allows you to type in code line by line and see what it does. This is quite useful for prototyping, experimentation, and debugging code. Other programming languages, and especially C, use a "compile-run" model,
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
http://www.blue.sky.or.jp/grass/grass.rb
Route 477
{{#tags}}- {{label}}
{{/tags}}