From b6e5db7f27f12af4ac7c1d186d367c65c00824d2 Mon Sep 17 00:00:00 2001 From: Jed Barber Date: Fri, 30 Mar 2018 17:32:45 +1100 Subject: Fixed HTML bugs --- project/assets/css/steelman.css | 2 +- project/templates/links.html | 4 +- project/templates/steelman.html | 908 ++++++++++++++++++++-------------------- project/templates/stvcount.html | 1 - 4 files changed, 457 insertions(+), 458 deletions(-) diff --git a/project/assets/css/steelman.css b/project/assets/css/steelman.css index 4123e75..5b6b5c9 100644 --- a/project/assets/css/steelman.css +++ b/project/assets/css/steelman.css @@ -44,7 +44,7 @@ table#appendix td { } -table#appendix td#yn { +table#appendix td.yn { text-align: center; height: 1em; } diff --git a/project/templates/links.html b/project/templates/links.html index b0edeaa..c4b91e8 100644 --- a/project/templates/links.html +++ b/project/templates/links.html @@ -90,7 +90,7 @@ chances are someone else might too. Note that this list is not anywhere near exh Cruise Missile
  • Distillation Apparatus
    • -
  • +
  • Feetforward Motorbike
  • FPGA4Fun
    • @@ -281,7 +281,7 @@ chances are someone else might too. Note that this list is not anywhere near exh Electoral Royal Commission
  • Free Distribution
    • -
  • +
  • Leading Surveillance Societies 2007
  • NBN Myths
    • diff --git a/project/templates/steelman.html b/project/templates/steelman.html index 652f781..4c0d209 100644 --- a/project/templates/steelman.html +++ b/project/templates/steelman.html @@ -43,7 +43,7 @@ collection, and a standard threading model.

    Parasail is a research language created in 2009 by AdaCore, the main vendor of Ada compiler tooling today. The language is designed with implicit -parallelism throughout, simplifying and adding static checking +parallelism throughout, simplifying and adding static checking to eliminate as many sources of errors as possible. It represents a possible future direction for Ada derived languages.

    Pascal, like C, predates @@ -239,10 +239,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader real time control, self diagnostics, input-output to nonstandard peripheral devices, parallel processing, numeric computation, and file processing. - yes - no? - yes? - yes? + yes + no? + yes? + yes? @@ -259,10 +259,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader explanatory diagnostic and warning messages, but shall not attempt to correct programming errors. - yes? - yes - partial? - mostly? + yes? + yes + partial? + mostly? @@ -278,10 +278,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader for instances where the default is stated in the language definition, is always meaningful, reflects the most frequent usage in programs, and may be explicitly overridden. - partial? - yes? - mostly? - partial? + partial? + yes? + mostly? + partial? @@ -303,10 +303,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader execution costs. Execution time support packages of the language shall not be included in object code unless they are called. - partial? - yes? - yes - yes? + partial? + yes? + yes + yes? @@ -325,10 +325,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader provide several notations for the same concept. No arbitrary restriction should be imposed on a language feature. - yes? - mostly - yes - yes + yes? + mostly + yes + yes @@ -345,10 +345,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader the production of translators that are easy to implement and are efficient during translation. There shall be no language restrictions that are not enforceable by translators. - yes - yes - yes - yes + yes + yes + yes + yes @@ -366,10 +366,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader for defining those portions of programs that are dependent on the object machine configuration and for conditionally compiling programs depending on the actual configuration. - yes - yes - yes - yes + yes + yes + yes + yes @@ -382,10 +382,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader that a formal definition assists in achieving the above goals (i.e., all of section 1), the language shall be formally defined. - yes - yes - mostly? - mostly? + yes + yes + mostly? + mostly? @@ -398,16 +398,16 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 2A. Character Set. The full set of character graphics that may be used in source programs shall be given in the language definition. Every source program shall also have a representation that uses - only the following 55 character subset of the ASCII graphics: %&'()*+,-./:;<=>? 0123456789 + only the following 55 character subset of the ASCII graphics: %&'()*+,-./:;<=>? 0123456789 ABCDEFGHIJKLMNOPQRSTUVWXYZ_ Each additional graphic (i.e., one in the full set but not in the 55 character set) may be replaced by a sequence of (one or more) characters from the 55 character set without altering the semantics of the program. The replacement sequence shall be specified in the language definition. - mostly - mostly - mostly - mostly + mostly + mostly + mostly + mostly @@ -420,10 +420,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader structure. The language shall have free form syntax and should use familiar notations where such use does not conflict with other goals. - partial? - yes - yes - partial? + partial? + yes + yes + partial? @@ -438,10 +438,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader particular the user shall not be able to introduce new precedence rules or to define new syntactic forms. - yes - yes - yes - no + yes + yes + yes + no @@ -458,10 +458,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader shall be bracketed (i.e., shall have a closing as well as an opening key word). Programs may not contain unmatched brackets of any kind. - mostly - yes - mostly - mostly + mostly + yes + mostly + mostly @@ -477,10 +477,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader identifiers or reserved words to be abbreviated. (Note that this does not preclude reserved words that are abbreviations of natural language words.) - yes - yes - yes - yes + yes + yes + yes + yes @@ -494,10 +494,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader may be replaced by identifiers, shall not be reserved (e.g., names of functions, types, constants, and variables shall not be reserved). All reserved words shall be listed in the language definition. - yes - yes - yes - yes + yes + yes + yes + yes @@ -509,10 +509,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 2G. Numeric Literals. There shall be built-in decimal literals. There shall be no implicit truncation or rounding of integer and fixed point literals. - mostly - yes - mostly? - mostly + mostly + yes + mostly? + mostly @@ -528,10 +528,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 2H. String Literals. There shall be a built-in facility for fixed length string literals. String literals shall be interpreted as one-dimensional character arrays. - yes - yes - yes - yes + yes + yes + yes + yes @@ -544,10 +544,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 2I. Comments. The language shall permit comments that are introduced by a special (one or two character) symbol and terminated by the next line boundary of the source program. - yes - yes - partial - yes + yes + yes + partial + yes @@ -560,10 +560,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 3A. Strong Typing. The language shall be strongly typed. The type of each variable, array and record component, expression, function, and parameter shall be determinable during translation. - mostly - yes - yes - yes + mostly + yes + yes + yes @@ -580,10 +580,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader shall be no implicit conversions between types. Explicit conversion operations shall be automatically defined between types that are characterized by the same logical properties. - partial? - yes - yes? - partial? + partial? + yes + yes? + partial? @@ -601,10 +601,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader associated with each type. No restriction shall be imposed on user defined types unless it is imposed on all types. - mostly - yes - yes? - mostly + mostly + yes + yes? + mostly @@ -620,10 +620,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader specified when the variable is declared. The language should encourage such specifications. [Note that such specifications can aid the clarity, efficiency, maintainability, and provability of programs.] - partial - yes? - mostly? - no + partial + yes? + mostly? + no @@ -638,10 +638,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader computation. Numeric operations and assignment that would cause the most significant digits of numeric values to be truncated (e.g., when overflow occurs) shall constitute an exception situation. - partial? - yes - partial? - mostly? + partial? + yes + partial? + mostly? @@ -659,10 +659,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader equal, and greater than or equal) between elements of each numeric type. Numeric values shall be equal if and only if they have exactly the same abstract value. - mostly - yes - mostly - mostly + mostly + yes + mostly + mostly @@ -679,10 +679,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader to be implemented and as the maximum range needed by the application. Explicit conversion operations shall not be required between numeric ranges. - yes - yes - yes - yes + yes + yes + yes + yes @@ -699,10 +699,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader minimum accuracy (not significance) to be implemented. Approximate results shall be implicitly rounded to the implemented precision. Explicit conversions shall not be required between precisions. - mostly - yes - no - mostly + mostly + yes + no + mostly @@ -719,10 +719,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader precisions, radix, and exponent range available in the object machine. There shall be built-in operations to access the actual precision, radix, and exponent range of the implementation. - yes - yes? - partial - yes? + yes + yes? + partial + yes? @@ -736,10 +736,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 3-1F. Integer and Fixed Point Numbers. Integer and fixed point numbers shall be treated as exact numeric values. There shall be no implicit truncation or rounding in integer and fixed point computations. - mostly - yes - partial - mostly + mostly + yes + partial + mostly @@ -754,10 +754,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader values) of each fixed point variable must be specified in programs and be determinable during translation. Scales shall not be restricted to powers of two. - no - yes - no - no + no + yes + no + no @@ -772,10 +772,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader operations for exact arithmetic shall apply between arbitrary scales. Additional operations between arbitrary scales shall be definable within programs. - no - yes - no - no + no + yes + no + no @@ -789,10 +789,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader their elements. The elements of an enumeration type may be identifiers or character literals. Each variable of an enumeration type may be restricted to a contiguous subsequence of the enumeration. - mostly - yes - yes - mostly + mostly + yes + yes + mostly @@ -808,10 +808,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader automatically defined so that the successor, predecessor, the position of any element, and the first and last element of the type may be computed. - yes - yes? - yes? - mostly? + yes + yes? + yes? + mostly? @@ -822,10 +822,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 3-2C. Boolean Type. There shall be a predefined type for Boolean values. - yes - yes - yes - yes + yes + yes + yes + yes @@ -838,10 +838,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 3-2D. Character Types. Character sets shall be definable as enumeration types. Character types may contain both printable and control characters. The ASCII character set shall be predefined. - yes - yes - yes - yes + yes + yes + yes + yes @@ -854,10 +854,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader types. Composite types shall include arrays (i.e., composite data with indexable components of homogeneous types) and records (i.e., composite data with labeled components of heterogeneous type). - yes - yes - yes - yes + yes + yes + yes + yes @@ -872,10 +872,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader (including array and record types). Range, precision, and scale specifications shall be required for each component of appropriate numeric type. - yes - yes - yes - yes + yes + yes + yes + yes @@ -893,10 +893,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader used anywhere in a program that a variable of the component's type is permitted. There shall be no automatically defined equivalence operations between values of elements of a composite type. - yes - yes - yes - yes + yes + yes + yes + yes @@ -910,10 +910,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader determinable at the time of array allocation. The range of each subscript value must be restricted to a contiguous sequence of integers or to a contiguous sequence from an enumeration type. - mostly - yes - yes - mostly + mostly + yes + yes + mostly @@ -927,10 +927,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader catenation of contiguous sections of one-dimensional arrays of the same component type. The results of such access and catenation operations may be used as actual input parameter. - yes - yes? - no - partial + yes + yes? + no + partial @@ -945,10 +945,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader may be thought of as record components and may be referenced using the same notation as for accessing record components. Assignment shall not be permitted to such components. - yes - yes - no? - no? + yes + yes + no? + no? @@ -961,10 +961,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 3-3G. Variants. It shall be possible to define types with alternative record structures (i.e., variants). The structure of each variant shall be determinable during translation. - yes - yes? - yes - yes + yes + yes? + yes + yes @@ -979,10 +979,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader discriminate among the variants during execution). It shall not be possible to alter a tag field without replacing the entire variant. - yes - yes? - yes? - yes + yes + yes? + yes? + yes @@ -998,10 +998,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader be referenced by the program. [Note that indirect types require pointers and sometimes heap storage in their implementation.] - yes - yes - yes - yes + yes + yes + yes + yes @@ -1016,10 +1016,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader and an operation that produces a new element having the same component values as its argument, shall be automatically defined for each indirect type. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1031,10 +1031,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 3-4A. Bit Strings (i.e., Set Types). It shall be possible to define types whose elements are one-dimensional Boolean arrays represented in maximally packed form (i.e, whose elements are sets). - yes - yes - yes - partial + yes + yes + yes + partial @@ -1051,10 +1051,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader component-by-component negation, conjunction, inclusive disjunction, and exclusive disjunction respectively) operations shall be defined automatically for each set type. - yes - yes? - yes - partial + yes + yes? + yes + partial @@ -1068,10 +1068,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader that is definable in programs. The language shall permit multiple explicit instantiations of an encapsulation. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1087,10 +1087,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader such as type conversions and equality. Definitions that are made within an encapsulation and are externally accessible may be renamed before use outside the encapsulation. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1103,10 +1103,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader or process of the encapsulation, shall remain allocated and retain their values throughout the scope in which the encapsulation is instantiated. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1118,10 +1118,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 4A. Form of Expressions. The parsing of correct expressions shall not depend on the types of their operands or on whether the types of the operands are built into the language. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1135,10 +1135,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader uniquely determined during translation from the context of its use (as might be the case with a literal). - yes - yes - yes - yes + yes + yes + yes + yes @@ -1155,10 +1155,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader within an expression shall not be guaranteed. [Note that the latter implies that any program that depends on the order of side effects is erroneous.] - mostly? - yes? - mostly? - mostly? + mostly? + yes? + mostly? + mostly? @@ -1171,10 +1171,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 4D. Allowed Usage. Expressions of a given type shall be allowed wherever both constants and variables of the type are allowed. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1188,10 +1188,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader include only literals and the use of translation time facilities (see 11C) shall be evaluated during translation. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1204,10 +1204,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader and infix) operators shall be specified in the language definition, shall not be alterable by the user, shall be few in number, and shall not depend on the types of the operands. - mostly - yes - yes - mostly + mostly + yes + yes + mostly @@ -1225,10 +1225,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader association whenever a nonassociative operator appears to the left of an operator of the same precedence at the least-binding precedence level of any subexpression.] - yes - yes - yes - yes + yes + yes + yes + yes @@ -1241,10 +1241,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader constants shall include both those whose values-are determined during translation and those whose value cannot be determined until allocation. Programs may not assign to constants. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1258,10 +1258,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader be determinable during translation. [Note, "variable" throughout this document refers not only to simple variables but also to composite variables and to components of arrays and records.] - mostly - yes - yes - partial + mostly + yes + yes + partial @@ -1278,10 +1278,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader may be made in any scope. Anything other than a variable shall be accessable within any nested scope of its definition. - yes? - yes - yes - yes? + yes? + yes + yes + yes? @@ -1294,10 +1294,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader statements shall not be assignable to variables, be computable as values of expressions, or be usable as nongeneric parameters to procedures or functions. - no - no - no? - no + no + no + no? + no @@ -1309,10 +1309,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 5E. Initial Values. There shall be no default initial-values for variables. - partial - partial - partial? - mostly + partial + partial + partial? + mostly @@ -1327,10 +1327,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 5F. Operations on Variables. Assignment and an implicit value access operation shall be automatically defined for each variable. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1345,10 +1345,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader procedures, and processes shall be closed scopes. Bodies of classical control structures shall be open scopes. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1364,10 +1364,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader have only one entry point and shall exit to a single point unless exited via an explicit transfer of control (where permitted, see 6G), or the raising of an exception (see 10C). - yes - yes - yes - yes + yes + yes + yes + yes @@ -1381,10 +1381,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader between statement terminators and statement separators, unless the restriction makes programming errors less likely. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1402,10 +1402,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader when no other path is selected. Only the selected branch shall be compiled when the discriminating condition is a translation time expression. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1417,10 +1417,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 6D. Short Circuit Evaluation. There shall be infix control operations for short circuit conjunction and disjunction of the controlling Boolean expression in conditional and iterative control structures. - yes - yes - partial - yes + yes + yes + partial + yes @@ -1435,10 +1435,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader enumeration type or the integers may be associated with successive iterations and the value for the current iteration accessed as a constant throughout the loop body. - mostly - yes - yes - yes + mostly + yes + yes + yes @@ -1454,10 +1454,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader no control transfer mechanisms in the form of switches, designational expressions, label variables, label parameters, or alter statements. - yes? - partial - yes - partial? + yes? + partial + yes + partial? @@ -1474,10 +1474,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader (i.e., overloading shall be permitted). [Note that redefinition, as opposed to overloading, of an existing function or procedure is often error prone.] - yes - yes - yes - no + yes + yes + yes + no @@ -1489,10 +1489,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 7B. Recursion. It shall be possible to call functions and procedures recursively. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1506,10 +1506,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader shall refer to a program element that is lexically global, rather than to one that is global through the dynamic calling structure. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1523,10 +1523,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader any type. If a result is of a nonindirect array or record type then the number of its components must be determinable by the time of function call. - mostly - mostly - mostly? - mostly + mostly + mostly + mostly? + mostly @@ -1544,10 +1544,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader parameter shall be determined at time of call and must be a variable or an assignable component of a composite type. - partial - yes - partial? - partial? + partial + yes + partial? + partial? @@ -1564,10 +1564,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader such constraints are permitted they shall be interpreted as assertions and not as additional overloading. Corresponding formal and actual parameters must be of the same type. - yes? - yes - yes - yes? + yes? + yes + yes + yes? @@ -1582,10 +1582,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader call to call. Subscript ranges shall be accessible within function and procedure bodies without being passed as explicit parameters. - no - yes - yes - no + no + yes + yes + no @@ -1603,10 +1603,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader referenced as nonlocals within a function or routine, is not prohibited. All aliasing of components of elements of an indirect type shall be considered intentional. - no - yes - yes? - yes + no + yes + yes? + yes @@ -1619,10 +1619,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader receive control information to and from physical channels and devices. The low level operations shall be chosen to insure that all user level input-output operations can be defined within the language. - partial? - no? - partial? - no? + partial? + no? + partial? + no? @@ -1637,10 +1637,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader to create, delete, open, close, read, write, position, and interrogate both sequential and random access files and to alter the association between logical files and physical devices. - yes - yes - yes - yes + yes + yes + yes + yes @@ -1653,10 +1653,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader are known to the translator (i.e., data that is created and written entirely within the program or data whose representation is explicitly specified in the program). - yes - yes - yes - yes + yes + yes + yes + yes @@ -1669,10 +1669,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader system. [Note that on many machines it will be necessary to provide run-time procedures to implement some features of the language.] - yes - yes - yes - yes + yes + yes + yes + yes @@ -1685,10 +1685,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader physical resources (e.g., memory or processors) that are managed (e.g., allocated or scheduled) by built-in features of the language. - mostly - mostly - partial - no + mostly + mostly + partial + no @@ -1705,10 +1705,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader integers, or an enumeration element to its symbolic form). These conversion operations shall have the same semantics as those specified for literals in programs. - yes - yes - yes - partial + yes + yes + yes + partial @@ -1723,10 +1723,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader Each process (activation) must have a name. It shall not be possible to exit the scope of a process name unless the process is terminated (or uninitiated). - yes - mostly - no - yes + yes + mostly + no + yes @@ -1743,10 +1743,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader execution time and space. Processes shall have consistent semantics whether implemented on multicomputers, multiprocessors, or with interleaved execution on a single processor. - yes - yes - no - yes + yes + yes + no + yes @@ -1760,10 +1760,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader shall cause a warning. It shall be possible efficiently to perform mutual exclusion in programs. The language shall not require any use of mutual exclusion. - partial? - yes - no - yes + partial? + yes + no + yes @@ -1782,10 +1782,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader user without loss of efficiency. Note also that priority specification does not impose a specific execution order among parallel paths and thus does not provide a means for mutual exclusion.] - yes? - yes? - no - partial? + yes? + yes? + no + partial? @@ -1800,10 +1800,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader execution. A process may have an accessible clock giving the cumulative processing time (i.e., CPU time) for that process. - yes - yes - yes? - yes? + yes + yes + yes? + yes? @@ -1816,10 +1816,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 9G. Asynchronous Termination. It shall be possible to terminate another process. The terminated process may designate the sequence of statements it will execute in response to the induced termination. - yes - no? - no - yes + yes + no? + no + yes @@ -1835,10 +1835,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader It shall be possible to delay such data transfers until both the sending and receiving processes have requested the transfer. - yes - yes - no - yes + yes + yes + no + yes @@ -1852,10 +1852,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader (without delay, if it is already set). Setting a signal, that is not already set, shall cause exactly one waiting path to continue. - mostly? - mostly? - no - mostly? + mostly? + mostly? + no + mostly? @@ -1867,10 +1867,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 9J. Waiting. It shall be possible to wait for, determine, and act upon the first completed of several wait operations (including those used for data passing, signalling, and real time). - mostly? - mostly? - no - mostly? + mostly? + mostly? + no + mostly? @@ -1886,10 +1886,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader identifiers shall have a scope. Exceptions should add to the execution time of programs only if they are raised. - yes - partial? - partial? - partial + yes + partial? + partial? + partial @@ -1910,10 +1910,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader [Note that some are very expensive to detect unless aided by special hardware, and consequently their detection will often be suppressed (see 10G).] - partial? - mostly - partial - partial? + partial? + mostly + partial + partial? @@ -1932,10 +1932,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader Exceptions that are not handled within a process shall terminate the process. Exceptions that can be raised by built-in operations shall be given in the language definition. - yes - partial - partial - partial + yes + partial + partial + partial @@ -1954,10 +1954,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader control path for all exceptions not otherwise mentioned in such a discrimination. It shall be possible to raise the exception that selected the current handler when exiting the handler. - yes - no? - partial - no + yes + no? + partial + no @@ -1970,10 +1970,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 10E. Order of Exceptions. The order in which exceptions in different parts of an expression are detected shall not be guaranteed by the language or by the translator. - yes? - yes - yes - yes + yes? + yes + yes + yes @@ -1987,10 +1987,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader to include assertions, such as the expected frequency for selection of a conditional path, that cannot be verified. [Note that assertions can be used to aid optimization and maintenance.] - mostly - mostly - no - mostly + mostly + mostly + no + mostly @@ -2005,10 +2005,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader the integrity of the values produced when a suppressed exception occurs. [Note that suppression of an exception is not an assertion that the corresponding error will not occur.] - partial - no - no - no + partial + no + no + no @@ -2031,10 +2031,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader the association of physical resources (e.g., interrupts) to program elements (e.g., exceptions or signals). - partial? - no? - no - partial + partial? + no? + no + partial @@ -2051,10 +2051,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader time expression, the type of actual generic parameters, and the values of constraints characterizing the subtype of actual parameters. - partial - partial? - no - partial + partial + partial? + no + partial @@ -2071,10 +2071,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader of the object machine, may be made more portable by enclosing those portions in branches of conditionals on the object machine configuration.] - no? - no? - no - no? + no? + no? + no + no? @@ -2088,10 +2088,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader in both the source language program and foreign code must be identified in the interface. The source language of the foreign code must also be identified. - yes - no - mostly - yes + yes + no + mostly + yes @@ -2112,10 +2112,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader optimization shall not alter the semantics of correct programs, (e.g., the semantics of parameters will be unaffected by the choice between open and closed calls). - partial? - no? - partial? - partial? + partial? + no? + partial? + partial? @@ -2131,10 +2131,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader library shall be structured to allow entries to be associated with particular applications, projects, and users. - yes - yes - yes - yes + yes + yes + yes + yes @@ -2148,10 +2148,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader of other units. All language imposed restrictions shall be enforced across such interfaces. Separate translation shall not change the semantics of a correct program. - mostly? - yes? - yes? - yes? + mostly? + yes? + yes? + yes? @@ -2166,10 +2166,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader (including those for variables, functions, procedures, processes, and types) or the value of any expression. - yes - yes - partial - mostly + yes + yes + partial + mostly @@ -2186,10 +2186,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader and appropriate examples of each built-in and predefined feature. A recommended set of translation diagnostic and warning messages shall be included in the language definition. - mostly? - mostly? - yes - partial + mostly? + mostly? + yes + partial @@ -2201,10 +2201,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader 13B. Standards. There will be a standard definition of the language. Procedures will be established for standards control and for certification that translators meet the standard. - no - no - yes - no + no + no + yes + no @@ -2218,10 +2218,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader that is available to the user shall be defined in the standard, in an accessible library, or in the source program. - mostly? - yes - yes - mostly + mostly? + yes + yes + mostly @@ -2240,10 +2240,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader translation. If the translator determines that a call on a routine will not terminate normally, the exception shall be reported as a translation error at the point of call. - mostly? - yes - yes? - yes? + mostly? + yes + yes? + yes? @@ -2259,10 +2259,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader of the translator (i.e., the translation method) shall not be specified by the language definition or standards. - mostly - mostly - mostly - mostly + mostly + mostly + mostly + mostly @@ -2281,10 +2281,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader number of array dimensions, on the number of identifiers, on the length of identifiers, or on the number of nested parentheses levels. - yes - yes - yes? - yes + yes + yes + yes? + yes @@ -2302,10 +2302,10 @@ turned out to be educated guesses. Fairness was the goal, but nonetheless reader implementation, distribution, and maintenance of translators, software tools and aids, and application libraries will be provided independently of the individual projects that use them. - mostly - partial - yes - partial + mostly + partial + yes + partial diff --git a/project/templates/stvcount.html b/project/templates/stvcount.html index cbd9458..02b47ec 100644 --- a/project/templates/stvcount.html +++ b/project/templates/stvcount.html @@ -86,7 +86,6 @@ superfluous logging.

    slightly from the ones provided by the AEC's official distribution of preferences. Investigations into the exact cause are ongoing.

    -

    Results

    Calculations were done for each state using the formal preference data with vacancies set to 6 instead of 12, -- cgit