Abstract This document describes AsmL, a specification language based on abstract state machines. Foundations of Software Engineering Microsoft Research (c) Microsoft Corporation. All rights reserved. Contents 1 Introduction 6



Download 0.93 Mb.
Page5/25
Date28.01.2017
Size0.93 Mb.
#9776
1   2   3   4   5   6   7   8   9   ...   25

1.15Keywords


AsmL recognizes the following tokens as keywords.

->

{

error

interface

out

sum

..

|

event

internal

override

the

:=

}

exists

intersect

primitive

then

<=

abstract

explore

is

private

throw

<>

add

extends

let

procedure

to

>=

and

fixpoint

lt

process

try

(

any

for

lte

property

type

)

as

forall

match

protected

union

*

case

foreach

max

public

unique

+

catch

from

me

ref

until

,

choose

function

merge

remove

value

-

class

get

min

require

var

.

const

gt

mod

resulting

virtual

/

constraint

gte

mybase

return

where

:

delegate

holds

namespace

sealed

while

<

do

if

ne

search




=

else

ifnone

new

set




>

elseif

implements

not

shared




?

ensure

implies

notin

skip




[

enum

import

of

step




]

enumerated

in

operator

structure

 

+=

*=

initially

or

subset

 

_

eq

inout

otherwise

subseteq




Alternatives eq, ne, lt, gt, le and ge may be substituted for "=", "<>", "<", "<=",">" and ">=", respectively. (This makes it easier for AsmL source code to be integrated into XML documents in some situations.)

The keywords the, min, max and sum used to introduce a select expression (see section below) may also be used as identifier tokens.


Download 0.93 Mb.

Share with your friends:
1   2   3   4   5   6   7   8   9   ...   25




The database is protected by copyright ©ininet.org 2024
send message

    Main page