Google
 
   
Login
Username:

Password:


Lost Password?

Register now!
Search
Main Menu
top books
Polls
What do you think about php-deluxe.net?
Excellent!
Cool
Hmm..not bad
What the hell is this?
encyclopedia
recommendation
compare webbrowser
Freenet DSL
Who's Online
6 user(s) are online (6 user(s) are browsing encyclopedia)

Members: 0
Guests: 6

more...
browser tip
Unix Befehle
manual of unix befehle
recommendation!
Sponsored
partner

Name resolution

In computer science, name resolution (also called name lookup) is the process of finding the entity that an identifier used in a certain context refers to.

= Name resolution in computer languages =

Expressions in computer languages can contain identifiers. The semantics of such expressions depend on the entities that the identifiers refer to. The Algorithm that determines what an identifier in a given context refers to is part of the language definition.

The complexity of these algorithms is influenced by the sophistication of the language. For example, name resolution in assembly language usually involves only a single simple Associative_array, while name resolution in C plus plus is extremely complicated as it involves:

  • namespace (programming)s, which make it possible for an identifier to have different meanings depending on its associated namespace;
  • scope (programming)s, which make it possible for an identifier to have different meanings at different scope levels, and which involves various scope overriding and hiding rules. At the most basic level name resolution usually attempts to find the binding (computer science) in the smallest enclosing scope, so that for example local variables supersede global variables; this is called shadowing .
  • visibility rules , which determine whether identifiers from specific namespaces or scopes are visible from the current context;
  • Overloading#Overloading, which makes it possible for an identifier to have different meanings depending on how it is used, even in a single namespace or scope;
  • accessibility , which determines whether identifiers from an otherwise visible scope are actually accessible and participate in the name resolution process.
  • == Static versus dynamic ==

    In programming languages, name resolution can be performed either at compile time or at Runtime. The former is called static name resolution, the latter is called dynamic name resolution.

    Examples of programming languages that use static name resolution include C programming language, C++, Java programming language, and Pascal programming language. Examples of programming languages that use dynamic name resolution include Lisp programming language, Perl programming language, and Python programming language.

    = Name resolution in computer networks =

    In computer networks, name resolution is used to find a lower level address (such as an IP address) that corresponds to a given higher level address (such as a hostname). See Domain Name System, OSI Model.

    = See also =

  • namespace (programming)
  • Scope (programming)