The Language Evaluation Criteria
There are a vast amount of programming language that we are using. Some are designed to accomplish some specific task. Some are for common uses. Any way the below described is a short ‘summery’ of the criteria we followed to evaluate the language.
a. Overall Simplicity
c. Data Types
d. Syntax Design
a. Simplicity and Orthogonality
b. Support for Abstraction
a. Type Checking
b. Exception Handling
d. Readability and Writability
It is the ease with which programs can be read and understood.
· Overall Simplicity.
o A manageable set of features and constructs
o Few feature multiplicity (means of doing the same operation)
o Minimal operator overloading
o Function overloading
o A relatively small set of primitive constructs can be combined in a relatively small number of ways.
o Every possible combination is legal.
· Control statements.
o The presence of well-known control structures (e.g., while statement).
o Data types and structures.
o The presence of adequate facilities for defining data structures.
· Syntax considerations
o Identifier forms: flexible composition.
o Special words and methods of forming compound statements.
o Form and meaning: self-descriptive constructs, meaningful keywords.
It is the easiness with which a program can be created.
· Simplicity and Orthogonality
o Few constructs, a small number of primitives, a small set of rules for combining them.
· Support for abstraction
o The ability to define and use complex structures or operations in ways that allow details to be ignored.
o A set of relatively convenient ways of specifying operations.
o Example: the inclusion of for statement in many modern languages.
It is the ability of a programming language to perform to its specifications.
· Type checking
o Testing for type errors.
· Exception handling
o Intercept run-time errors and take corrective measures.
o Presence of two or more distinct referencing methods for the same memory location.
· Readability and Writability
o A language that does not support “natural” ways of expressing an algorithm will necessarily use “unnatural” approaches, and hence reduced reliability.
o Training programmers to use language.
o Writing programs (closeness to particular applications).
o Compiling programs.
o Executing programs.
o Language implementation system: availability of free compilers, libraries.
o Reliability: poor reliability leads to high costs.
o Maintaining programs.