Sunteți pe pagina 1din 2

B Langage Keywords and Operators version 1.8.

5
ASCII ! " # $0 % & ' ( ) * x ** y + +-> +->> , --> -->> -> . .. / /: /<: /<<: /= /\ /|\ : : :: := ; 80 : q 3 7 k 2 6 x
y

Math.

Pri. 250

As.

Description For any String or definition file

ASCII < <+ <-> <<-<: <<: <<| <= <=> <| = == => > >+> >-> >+>> >->> >< >=
ABSTRACT_CONSTANTS ABSTRACT_VARIABLES

Math.

Pri. 50

As. G G G G G

Description Strictly less than Overload a relation Set of relations Insert at end of sequence Operation output parameters Inclusion Strict inclusion Substraction to the domain Less than or equal Equivalence Restriction to the domain Equals Definition

ASCII CONSTRAINTS DEFINITIONS DO EITHER ELSE ELSIF END

Math.

Pri.

As.

Description CONSTRAINTS clause DEFINITIONS clause WHILE substitution CASE substitution IF or CASE substitution IF substitution Terminator of clauses or of substitutions BEGIN, PRE, ASSERT, CHOICE, IF, SELECT, ANY, LET, VAR, CASE and WHILE clause EXTENDS Literal Boolean constant false

+ 1 j c a r

90 125 130

250

There exists Value of data before substitution

250 40 250 G G

Lambda expression Conjunction (logical AND) Access to a record field Open bracket Close bracket

60 60 130 50 30 130 50

G G G G G G G

190 200 180 125 125 115 180 210 125 125 130 220 170 190 60 60 60 50 140 150 60 80

G D G G G G G

Multiplication or Cartesian product Power of Addition Partial function Partial surjection Comma Subtraction Unary minus

EXTENDS FALSE FIN FIN1 IF IMPLEMENTATION IMPORTS IN INCLUDES INITIALISATION INT INTEGER INTER INVARIANT LET LOCAL_OPERATIONS MACHINE MAXINT MININT NAT NAT1 NATURAL NATURAL1 OF NAT1 N N1 Z I F F1

Set of finite sub-sets Set of finite non empty sub-sets Substitution IF IMPLEMENTATION clause IMPORTS clause BE or VAR substitution INCLUDES clause INITIALISATION clause Set of implementable relative integers Set of relative integers Quantified intersection INVARIANT clause or WHILE substitution LET substitution LOCAL_OPERATIONS clause MACHINE clause Largest implementable integer Smallest implementable integer Set of implementable natural integers Set of non-empty implementable natural integers Set of natural integers Set of non-empty natural integers CASE substitution

30 50

G G G G G G G G

Implies Strictly greater than Partial injection Total injection Partial bijection Total bijection Direct product of relations Greater than or equal ABSTRACT_CONSTANTS clause ABSTRACT_VARIABLES clause ANY substitution ASSERT substitution ASSERTIONS clause LET substitution BEGIN substitution Conversion of a predicate into a Boolean value CASE substitution CHOICE substitution CONCRETE_CONSTANTS clause CONCRETE_VARIABLES clause CONSTANTS clause

4 5 8 9

125 125 125 125 100 50

G G G D G G G G G G G G G G G G G

Total function Surjection Insert at the start of a sequence Renaming or data separator used in the operators , , , , , , Interval Integer division Non-belonging Non-inclusion Strict non-inclusion Not equal Intersection Restriction of a sequence to the head Belonging Record field Becomes part of (belonging) Becomes equal to Sequencing for substitution or composition of relations

ANY ASSERT ASSERTIONS BE BEGIN BOOL CASE CHOICE


CONCRETE_CONSTANTS CONCRETE_VARIABLES

CONSTANTS

Page 1 sur 2

B Langage Keywords and Operators version 1.8.5


ASCII OPERATIONS OR PI POW POW1 PRE PROMOTES PROPERTIES REFINES REFINEMENT SEES SELECT SETS SIGMA STRING THEN TRUE UNION USES VALUES VAR VARIANT VARIABLES WHEN WHERE WHILE [ [] \/ \|/ ] ^ arity bin bool ) 110 G u w 140 150 G G U P P1 Math. Pri. As. Description OPERATIONS clause CHOICE or CASE substitution Quantified integer product Set of sub-sets Set of non-empty sub-sets Precondition substitution PROMOTES clause PROPERTIES clause REFINES clause REFINEMENT clause SEES clause SELECT clause SETS clause Quantified product Set of character strings Precondition substitution, ASSERT, IF or CASE Literal Boolean constant true Quantified union USES clause VALUES clause VAR substitution WHILE substitution VARIABLES clause SELECT substitution ANY substitution WHILE substitution Start of sequence postfix Empty sequence pred Union prefix Restrict a sequence to the end prj1 End of sequence prj2 Concatenate sequences ran Tree node arity rank Binary tree in extension rec Predicate boolean cast prj1 prj2 ASCII btree card closure(R) closure1(R) conc const dom father first fnc front id infix inter iseq iseq1 iterate(R, n) last left max min mirror mod not or perm 40 G 190 G iseq1 R
n

Math.

Pri.

As.

Description Binary trees Cardinal

ASCII rel rev right seq seq1 size sizet skip son sons struct subtree succ tail top tree union { {} | |-> |> |>> || } r~

Math.

Pri.

As.

Description Set of relations Reverse of a sequence Right tree Set of sequences Set of non-empty sequences Size of a sequence Size of a tree Null substitution i son of a tree Sons of a tree node Set of records Subtree of a tree Successor Tail of a sequence Top of a tree Trees Generalized union Start of set
th

R* R
+

Reflexive closure of a relation Closure of a relation Concatenation of a succession Tree constructor Domain of a function Father of a tree node First element in a sequence Transformed into a function Front of a sequence Function identity Infix formulae of a tree General intersection Set of injective sequences Set of injective non-empty sequences Iteration of a relation Last element in a sequence Left tree Maximum in a set of integers Minimum in a set of integers Mirror of a tree Modulo Logical no Disjunction (logical OR) Set of permutations (bijective sequences) Postfix formulae of a tree Predecessor of an integer Prefix formulae of a tree First projection of a relation Second projection of a relation Range of a relation Rank of a tree node Record in extension

10 R A 160 130 130 100 G G G G G

Empty set Vertical bar used in , , , , , , Maplet Restriction to the range Substraction to the range Simultaneous substitutions parallel product of relations End of set

-1

230

Reverse relation

Page 2 sur 2

S-ar putea să vă placă și