翻訳と辞書
Words near each other
・ Befotaka
・ Befotaka Sud District
・ Befotaka, Analalava
・ Befotaka, Mahabo
・ BeFour
・ Befreiungshalle
・ Befri dig selv
・ Befriended
・ Befriender
・ Befrienders Worldwide
・ BeFrugal.com
・ Befu Station
・ Befu Station (Fukuoka)
・ Befu Station (Hyōgo)
・ Befudiom
Befunge
・ Befunolol
・ Befuraline
・ BEG
・ Beg
・ Beg Beg-e Ban Khoshg
・ Beg Ferati
・ Beg for It
・ Beg for It (album)
・ Beg for It (song)
・ Beg for Mercy
・ Beg Khan
・ Beg River
・ Beg the Question
・ Beg to Differ


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Befunge : ウィキペディア英語版
Befunge

Befunge is a stack-based, reflective, esoteric programming language. It differs from conventional languages in that programs are arranged on a two-dimensional grid. "Arrow" instructions direct the control flow to the left, right, up or down, and loops are constructed by sending the control flow in a cycle. It has been described as "a cross between Forth and Lemmings."
== History ==
The language was originally created by Chris Pressey in 1993 as an attempt to devise a language which is as hard to compile as possible — note that the p command allows for self-modifying code. Nevertheless, a number of compilers have subsequently been written. A number of extensions to the original "Befunge-93" specification also exist, most notably Funge-98, which extends the concept to an arbitrary number of dimensions and can be multithreaded, with multiple instruction pointers operating simultaneously on the same space. Befunge-extensions and variants are called ''Fungeoids'' or just ''Funges''.
The Befunge-93 specification restricts each valid program to a grid of 80 instructions horizontally by 25 instructions vertically. Program execution which exceeds these limits "wraps around" to a corresponding point on the other side of the grid; a Befunge program is in this manner topologically equivalent to a torus. Since a Befunge-93 program can only have a single stack and its storage array is bounded, the Befunge-93 language is not Turing-complete (however, it has been shown that Befunge-93 is Turing Complete with unbounded stack word size). The later Funge-98 specification provides Turing completeness by removing the size restrictions on the program; rather than wrapping around at a fixed limit, the movement of a Funge-98 instruction pointer follows a model dubbed "Lahey-space" after its originator, Chris Lahey. In this model, the grid behaves like a torus of finite size with respect to wrapping, while still allowing itself to be extended indefinitely.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Befunge」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.