-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.rpc
40 lines (28 loc) · 901 Bytes
/
main.rpc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
@#{<stdlib>}#@
<<<(
( Multi line comment)
The Module below is a example of RPC's odd and weird structure using Tree's and Nodes
Instead of classes and Modules RPC uses Trees and nodes within that tree. Every tree must
have at least one node. Inside of a node must be functions that are called.
Functions start at `VOID => RPCMAIN() {}`
)>>>
RPC Tree Structure (Treename) {
RPC>*NODE | Interface{} - (Arg | OutputStatement) INIT [
\/
RPCO INIT {{{
(
----> RPCOUTPUT << PREPARE(Arg)
.> RPCOUTPUT
)
}}}
/\
]
}
Variable Name : String = "Bob"
Variable Age : Integer = 20
String : Integer => CompareAndReturn(person, personage) -> Boolean {
<-cmp(person, personage)
}
VOID : Main() {
Treename::OutputStatement(CompareAndReturn(Name, Age))
}