### Table 1. The SIMPL Illustrative Language

1996

"... In PAGE 11: ...Table 1. The SIMPL Illustrative Language The grammar shown in Table1 speci es several sorts of abstract-syntax trees, using a variant of BNF grammar allowing regular expressions. The details are not so important, but note that the double brackets [[.... In PAGE 14: ...) The sorts value and number are introduced just for use in this illustrative ASD, and have no predetermined interpretation in Action Notation. Just as in Table1 , a vertical bar expresses union of sorts. The sort inclusion number = lt; integer leaves open whether number is bounded.... ..."

Cited by 31

### Table 1. The SIMPL Illustrative Language

909

"... In PAGE 11: ...Table 1. The SIMPL Illustrative Language The grammar shown in Table1 speci es several sorts of abstract-syntax trees, using a variant of BNF grammar allowing regular expressions. The details are not so important, but note that the double brackets [[.... In PAGE 14: ...) The sorts value and number are introduced just for use in this illustrative ASD, and have no predetermined interpretation in Action Notation. Just as in Table1 , a vertical bar expresses union of sorts. The sort inclusion number = lt; integer leaves open whether number is bounded.... ..."

### Table 1: The speci cation rules of a simple language

2000

"... In PAGE 2: ... Each rule r 2 R; r : A0 = t0A1t1 : : : tn?1Antn is interpreted as an algebraic oper- ation [r] : [A1] : : : [An] ! [A0] which constructs the elements w0 2 [A0] from the elements wi 2 [Ai], 1 i n, by the rule: [r](w1; w2; : : : wn) = w0 = t0w1t1w2 : : : tn?1wntn. We illustrate this de nition with the speci cation rules in Table1 . The syntax interpretation... In PAGE 2: ...Table 1: The speci cation rules of a simple language of the parameters used in these rules is de ned by the equations in Table 2. The syntax algebra of the language speci ed by the rules in Table1 is Syn(R) = hf [Id], [Ex], [T p], [St],... In PAGE 7: ... If w does not create (destroy) types and variable bindings and Tw coincide with the prede ned types then the computation is expressed by a transition of the form f(Dw; quot; w) w 7! (Dw; w #)g. [[St]] = 8w 2 [St] if w = id:= e then [[St]] [ (D; quot; id := e) := 7! (D0; id := e #) where 0(x) = (x) if x 6 = id else [[e]] 8w 2 [St] if w = if e then s1 else s2 and [[e]] = true then [[St]] [ ((D; quot; if e then s1 else s2 fi) e 7! (D0; if e then quot; s1 else s2) (D0; if e then quot; s1 elses2 fi) s1 7! (D00; if e then s1 # else s2 fi) (D00; if e then s1 # else s2 fi) 7! (D00; if e then s1 else s2 fi quot;)) 8w 2 [St] if w = if e then s1 else s2 and [[e]] = false then [[St]] [ ((D; quot; if e then s1 else s2 fi) e 7! (D0; if e then s1 else quot; s2 fi) (D0; if e then s1 else quot; s2 fi) s2 7! (D00; if e then s1 else s2 # fi) (D00; if e then s1 else s2 # fi) 7! (D00; if e then s1 else s2 fi quot;)) 8w 2 [St] if w = while e do s od and [[e]] = true then [[St]] [ ((D; quot; while e do s od) e 7! (D0; while e do quot; s od) (D0; while e do quot; s od) s 7! (D00; while e do s # od) (D00; while e do s # od) 7! (D00; quot; while e do s od) 8w 2 [St] if w = while e do s od and [[e]] = false then [[St]] [ ((D; quot; while e do s od) e 7! (D0; while e do s # od) (D0; while e do s # od) 7! (D0; while e do s od quot;) Table 4: Semantic domain speci cation We illustrate the construction of the algebra Sem(R) using the speci cation rules given in Table1 , assuming that [[Id]] is the universe of names, [[Ex]] is the universe of values, and [[T p]] is the set of types. For x 2 [Id], e 2 [Ex] and t 2 [T p] we denote with x, e, and t, respectively, the corresponding transitions in [[Id]], [[Ex]], [[T p]], respectively.... In PAGE 7: ...[e]] 2 [[Ex]] is the value of the expression e computed in the current state, i.e., replacing each variable that occur in e with its value in the current state; [[St]] is shown in Table 4; [[Sl]], [[Dc]], [[Dl]], [[Bl]] are shown in Table 5. The semantics algebra of the language speci ed by the rules in Table1 is Sem(R) = hf[[Id]],[[Ex]],[[T p]],[[St]],[[Sl]],[[Dc]],[[Dl]],[[Bl]]g;f[[r1]],[[r2]],[[r3]],[[r4]],[[r5]],[[r6]],[[r7]],[[r8]],[[r9]],[[r10]], , gi, where the operations [[r1]] through [[r10]] are in Table 6. Fact 3: Sem(R) is embedded in the semigroup hf[[A]]jA 2 Ng; ; i by derived operations.... ..."

Cited by 2

### Table 1: Syntax and (short) semantics of a simple language

2004

"... In PAGE 4: ... For simplicity we will adopt an assembler-like language whose syntax and semantics are easy to describe. A summary of the (minimal) set of instructions we have cho- sen is shown in Table1 . Figures 9, 10, and 11 show several programs in the target language (those we have used to evaluate our implementations).... ..."

Cited by 2

### Table 2: A simple logging aspect language.

2002

Cited by 17

### Table 6.1: Abstract syntax of simple inheritance language.

1989

Cited by 134

### Table 4.2: Simple Channel Language Model for Post-Processor Search Example.

1995

Cited by 5

### Table II: Time of di erent events can be related by lexically simple natural language expressions.

19