. Glossary of Computer Language Terms ADT::=`Abstract data type`. ADT::=Net{ Values::Sets, Constants::@Values, Operations::@(%Values->Values),...}. array::data_type=`Each array associates each value of one data type with a unique object of another type` BNF::=`Backus Naur Form. An old version of a popular way to define syntx of prgramming languages`. EBNF::=`Extended BNF. A popular way to define syntax as a dictionary of terms defined by using iteration, options, alternatives, etc.`. XBNF::MATHS=`An extension to EBNF invented by Dr. Botting so that ASCII can be used to describe formal syntax and semantics`. Boolean::adjective=`Any data type that follows George Boole's algebraic axioms`. Boolean::data_type=`The data type with two values and the operations of and, or, and not which follows a Boolean algebra`. block::program_structure=`A piece of source code that has one or more declarations in it.`. data_type::=`A collection of values together with the operations that use them and produce them, plus the assumptions that can be made about the operations and values`. data_type::=structure | enumerated | primitive | array | file | pointer | ... . declaration::=`A piece of source code that adds a name to the programs environment and binds it to a meaning`. declaration::= variable_declaration | constant_declaration | type_declaration | subprogram_declaration | ... . enumerated::data_type=`data defined by listing its possible values`. function::mathematics=`A total many to one relation between a domain and a codomain`. function::C=`A subprogram`. function::business=`What you do to earn your pay`. grammar::=`A formal way of defining syntax`. grammar::math=`A set of definitions that define the syntax of a language.`. generate::=`A hypothetical process that uses a grammar to generate a list of all possible valid statements of sentences in a language`. parse::=`To convert a sequence of tokens into a data structure (typically a tree and a name table) that can be used to interpret or translate the sequence'. primitive::=`something that does not need to be defined`. int::=integer::data_type=`data representing a subset of the whole numbers`. Logical::=`In accordance with the speakers preconceptions`. Physical::=`In accordance with the speakers hardware`. lexeme::=`a string of characters in a language that is treated as a single unit in the syntax and semantics. For example identifiers and numbers are often lexemes.`. lexical::=`something that is related to the lexemes of a language`. token::=`a particular representation of a lexemes`. lexicon::=`a set of defintions defining the lexemes in a language`. dictionary::=`Any set of definitions`. glossary::=`a set of definitions that links terms in a language to an informal description in a natural language, and may also provide examples`. map::=function::=mapping, mapping::mathematics=`A relationship that takes something and turns it into something uniquely determined by the relationship`. natural_numbers::=`The numbers 1,2,3,4...`. predicate::logic=`A formula that may contain variables, that when evaluated should be either true or false`. predicate::Prolog=`A procedure that can fail or succeed in achieving a goal`. polymorphism::objects=`The ability of a function to apply to more than one type of object or data, even if the object is refered to by a pointer`. inheritance::objects=`The ability to easily construct new data types or classes by adding data and functions and methods to those described other data types or classes`. subtype::type=`a type of object that has all the properties, attributes, and operations/functions of another supper-type`. encapsulation::programming=`The ability to hide unwanted deatils inside an interface so that the result works like a black box or vending machine - providing useful services to many clients(programs or people)`. record::=record_structure::=structure.data_type. relation::=relationship. structure::data_type=`A finite collection of named items of data`, in an array all the data items are of the same type and the items are numbered. In a structure the items may have different types and they are named nit numbered. structure::program=sequence | selection | iteration | concurrent. syntax::=`A description of the rules that determine the validity and parsing of sentences or staements in a language`. semantics::=`A description of how the meaning of a valid statement or sentence can be worked out from its parsed form`.