Isbn: 9786130319083 (3 resultados)

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (3)

  • Nuevo (3)

a

Intervalo de precios personalizado (EUR)

a

  • Editorial: VDM Verlag Dr. Müller E.K. Dez 2009, 2009

    6130319088 / 9786130319083

    • Tapa blanda
    • Impresión bajo demanda

    Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 39,00

    Envío por EUR 23,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! 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 table lookup, while name resolution in C++ is extremely complicated as it involves: namespaces, which make it possible for an identifier to have different meanings depending on its associated namespace; scopes, 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 in the smallest enclosing scope, so that for example local variables supersede global variables; this is called shadowing. Englisch.…

  • Condición: Nuevo

    EUR 42,68

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! 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 table lookup, while name resolution in C++ is extremely complicated as it involves: namespaces, which make it possible for an identifier to have different meanings depending on its associated namespace; scopes, 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 in the smallest enclosing scope, so that for example local variables supersede global variables; this is called shadowing.…

  • Editorial: OmniScriptum, 2026

    6130319088 / 9786130319083

    • Tapa blanda
    • Impresión bajo demanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 125,30

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Taschenbuch. Condición: Neu. Name Resolution | Computer Science, Algorithm, Associative Array, Namespace (computer science), Method Overloading, Programming Language, Compile Time, AlphaRenaming | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130319083 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…