[Skip Navigation] [CSUSB] / [CNS] / [Comp Sci Dept] / [R J Botting] / [Samples] / comp.lang.Glossary
[Index] [Contents] [Source Text] [About] [Notation] [Copyright] [Comment/Contact] [Search ]
Tue Sep 18 15:25:18 PDT 2007

Contents


    Glossary of Computer Language Terms

  1. ADT::=Abstract data type.
  2. ADT::=Net{ Values::Sets, Constants::@Values, Operations::@(%Values->Values),...}.
  3. array::data_type=Each array associates each value of one data type with a unique object of another type

  4. BNF::=Backus Naur Form. An old version of a popular way to define syntx of prgramming languages.
  5. EBNF::=Extended BNF. A popular way to define syntax as a dictionary of terms defined by using iteration, options, alternatives, etc..
  6. XBNF::MATHS=An extension to EBNF invented by Dr. Botting so that ASCII can be used to describe formal syntax and semantics.

  7. Boolean::adjective=Any data type that follows George Boole's algebraic axioms.
  8. Boolean::data_type=The data type with two values and the operations of and, or, and not which follows a Boolean algebra.
  9. block::program_structure=A piece of source code that has one or more declarations in it..
  10. 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.
  11. data_type::=structure | enumerated | primitive | array | file | pointer | ... .

  12. declaration::=A piece of source code that adds a name to the programs environment and binds it to a meaning.
  13. declaration::= variable_declaration | constant_declaration | type_declaration | subprogram_declaration | ... .

  14. enumerated::data_type=data defined by listing its possible values.

  15. function::mathematics=A total many to one relation between a domain and a codomain.
  16. function::C=A subprogram.
  17. function::business=What you do to earn your pay.

  18. grammar::=A formal way of defining syntax.
  19. grammar::math=A set of definitions that define the syntax of a language..
  20. generate::=A hypothetical process that uses a grammar to generate a list of all possible valid statements of sentences in a language.
  21. 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'.

  22. primitive::=something that does not need to be defined.
  23. int::=integer::data_type=data representing a subset of the whole numbers.

  24. Logical::=In accordance with the speakers preconceptions.
  25. Physical::=In accordance with the speakers hardware.

  26. 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..
  27. lexical::=something that is related to the lexemes of a language.
  28. token::=a particular representation of a lexemes.
  29. lexicon::=a set of defintions defining the lexemes in a language.
  30. dictionary::=Any set of definitions.
  31. glossary::=a set of definitions that links terms in a language to an informal description in a natural language, and may also provide examples.

  32. map::=function::=mapping,
  33. mapping::mathematics=A relationship that takes something and turns it into something uniquely determined by the relationship.

  34. natural_numbers::=The numbers 1,2,3,4....

  35. predicate::logic=A formula that may contain variables, that when evaluated should be either true or false.
  36. predicate::Prolog=A procedure that can fail or succeed in achieving a goal.

  37. 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.

  38. 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.

  39. subtype::type=`a type of object that has all the properties, attributes, and operations/functions of another supper-type`.

  40. 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).

  41. record::=record_structure::=structure.data_type.
  42. relation::=relationship.

  43. 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.

  44. structure::program=sequence | selection | iteration | concurrent.
  45. syntax::=A description of the rules that determine the validity and parsing of sentences or staements in a language.
  46. semantics::=A description of how the meaning of a valid statement or sentence can be worked out from its parsed form.

End