1. Language description

2. Source example

3. Versions

4. Notes

5. References

6. External links
     Downloads  

BLISS is a system programming language developed at Carnegie Mellon University by W. A. Wulf, D. B. Russell, and A. N. Habermann around 1970. It was perhaps the best known systems programming language right up until C made its debut a few years later. Since then, C took off and BLISS faded into obscurity. When C was in its infancy, a few projects within Bell Labs were debating the merits of BLISS vs. C{{citation needed|date=February 2015}}.

BLISS is a typeless block-structured language based on expressions rather than statements, and includes constructs for exception handling, coroutines, and macros. It does not include a goto statement.

The name is variously said to be short for "Basic Language for Implementation of System Software" or "System Software Implementation Language, Backwards". It was sometimes called "Bill's Language for Implementing System Software", after Bill Wulf.

The original Carnegie Mellon compiler was notable for its extensive use of optimizations, and formed the basis of the classic book The Design of an Optimizing Compiler.

Language description

On the other hand, BLISS omits certain features of other high-level languages. It does not have built-in facilities for input/output, because a system-software project usually develops its own input/output or builds on basic monitor I/O or screen management services ... it permits access to machine-specific features, because system software often requires this. BLISS has characteristics that are unusual among high-level languages. A name ... is uniformly interpreted as the address of that segment rather than the value of the segment ... Also, BLISS is an "expression language" rather than a "statement language".

This means that every construct of the language that is not a declaration is an expression. Expressions produce a value as well as possibly causing an action such as modification of storage, transfer of control, or execution of a program loop. For example, the counterpart of an assignment "statement" in BLISS is, strictly speaking, an expression that itself has a value. The value of an expression can be either used or discarded in BLISS ... Finally, BLISS includes a macro facility that provides a level of capability usually found only in macro-assemblers.|Bliss Language Manual, Digital Equipment Corporation (1987)^[4]}}

The BLISS language has the following characteristics:

• All constants are full word for the machine being used, e.g. on a 16-bit machine such as the PDP-11, a constant is 16 bits; on a VAX computer, constants are 32 bits, and on a PDP-10, a constant is 36 bits.
• A reference to a variable is always to the address of that variable. For example, the instruction Z+8 refers to adding 8 to the address of Z, not to its value. If one needs to add 8 to the value of Z, one must prefix the variable with a period; so one would type .Z+8 to perform this function, which adds 8 to the contents of Z.
• Assignment is done with the standard = symbol, e.g. Z=8 – which says to create a full-word constant containing 8, and store it in the location whose address corresponds to that of Z. So Z+12=14 (or, alternatively 12+Z=14) places the constant 14 into the location which is 12 words after the address of Z. (This is considered bad practice.)
• Block statements are similar to those of ALGOL: a block is started with a BEGIN statement and terminated with END. As with ALGOL, statements are terminated with the semicolon (";"). When a value is computed, it is saved until the next statement terminator – which means that a value can be computed, assigned to a variable, and carried forward to the next statement, if desired. Alternatively, an open parenthesis may be used to begin a block, with the close parenthesis used to close the block. When parentheses are included in an expression, the standard precedence rules are used, in which parenthesized expressions are computed first,
• Conditional execution uses the IF expression, which tests a true-false condition, performs alternative actions, and returns a result.
• Comparison uses keywords such as EQL for equality (as opposed to overloading the = symbol for the same purpose), GTR for Greater Than, and NEQ for not equal. For example, the following code will assign the absolute value of Z to the address indicated by Q:

Q = (IF .Z GTR 0 THEN .Z ELSE -.Z);

• Identifiers (variables and constants) must be declared before use, typically using the OWN keyword. Declaring a variable normally causes the compiler to allocate space for it; when necessary, a variable may be assigned a fixed machine address via the BIND declaration. This feature is primarily used for accessing either machine registers or certain special addresses.
• Subroutines in the language are called routines, and are declared with the keyword ROUTINE.
• Macros, which allow for text substitution, are declared with the keyword MACRO.
• The language supports arrays, which are referred to as structures, and declared with the keyword VECTOR.
• The language supports some high-level programming constructs such as
  • Alternative execution paths via the CASE expression
  • Looping through use of the INCR expression, which is similar to ALGOL's FOR statement
  • Built-in string functions
  • Certain automatic data conversions (number to string, etc.)

Source example

The following example is taken verbatim from the Bliss Language Manual:^[4]

MODULE E1 (MAIN = CTRL) =

BEGIN

FORWARD ROUTINE

    CTRL,    STEP;

ROUTINE CTRL =

• Howie Koplitz
• Howie Krist
• Howie Kurtz
• Howie Lee
• Howie Machtinger
• Howie Mackie
• Howie Made Me Do it
• Howie made me do it
• Howie Mandell
• Howie Monroe
• Howie Morales
• Howie Morenz Memorial Game
• Howie Moss
• How I Ended This Summer
• Howie Nunn
• Howie Payne
• Howie Post
• Howie Roseman
• Howie Ruetz
• Howie scream
• Howie Slater
• Howie smith
• Howie Smith
• Howiesons Poort
• Howieson's Poort Shelter