〰

〰

〰

〰

Tmath

Search…

Grammar

Few handy lexical formalities

General structure

I propose following simple grammar with the following general structure:

`<Object A>`

`{lexical functor} <Object B>.`

Lexical operator which I use, are: $\{OF, OV, OT\}$

Lexical operator

Operand

Target object

`OV`

Value

`OF`

Function

`OT`

Type

I guess it's best to explain it by the following example.

1

// Let X be a variable and for now let's assume that B is a complex object

2

// Assuming dot notation expression

3

4

Expression: "X OV B" is equivalent to the

5

val x <==> B.value

6

7

Expression: "X OF B" is equivalent to the

8

function x <==> B.function

9

10

Expression: "X OT B" is equivalent to the

11

type x <==> typeof(B)

Copied!

In other words, **The lexical operator** accordingly to its kind {Value, Function, Type} creates bidirectional relationship between object A and B:

`A <=(O{V, F, T})=> B`

Sets

I use the following convention for typed set annotation.

`<prefix>-set.`

Where prefix is first letter of the according type. Abbreviations that I use, are expanded in the table below.Aliased

Expanded

`i-set`

Information set

`f-set`

Set of functions

`o-set`

Set of objects.

Last modified 4mo ago

Copy link

Edit on GitHub