OnlineWoerterBuecher.de
Internes

Lexikon


dynamic scope


In a dynamically scoped language, e.g. most versions of Lisp, an identifier can be referred to, not only in the block where it is declared, but also in any function or procedure called from within that block, even if the called procedure is declared outside the block. This can be implemented as a simple stack of (identifier, value) pairs, accessed by searching down from the top of stack for the most recent instance of a given identifier. The opposite is lexical scope. A common implementation of dynamic scope is shallow binding. (1996-07-11)

In addition suitable contents:
[ = ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ bi ] [ block ] [ by ] [ ca ] [ cc ] [ ch ] [ ck ] [ cl ] [ co ] [ com ] [ de ] [ dec ] [ ding ] [ do ] [ down ] [ du ] [ dynamically scoped ] [ ec ] [ ed ] [ edu ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ function ] [ ge ] [ gi ] [ gu ] [ h ] [ hat ] [ hing ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ instance ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ language ] [ Lex ] [ lexical scope ] [ Lisp ] [ ls ] [ lu ] [ ly ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ng ] [ nl ] [ no ] [ ns ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ procedure ] [ query ] [ rc ] [ re ] [ ro ] [ sc ] [ scope ] [ se ] [ sh ] [ shallow binding ] [ si ] [ sit ] [ so ] [ st ] [ stack ] [ T ] [ th ] [ to ] [ ua ] [ va ] [ value ] [ ve ] [ version ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4590 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1968 Seconds, with 17 Database-Queries
Zurück zur Startseite