glossia 0.2.0

Encode binary data (BIP39 mnemonics, keys, arbitrary payloads) into grammatically correct, human-readable natural language
Documentation 
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
39
40
41
42
43
44
45
46
47

// Pest grammar for parsing lambda calculus expressions
// Format: λx: Type. body or f(a) or constant

grammar = { SOI ~ expr ~ EOI }

expr = { abstraction | application | atom }

// Lambda abstraction: λx: Type. body or lambda x: Type. body
abstraction = {
    lambda_keyword ~ identifier ~ ":" ~ type_expr ~ "." ~ expr
}

lambda_keyword = { "λ" | "lambda" }

// Function application: f(a) or f a (prefix notation)
application = {
    atom ~ "(" ~ expr ~ ")"
}

// Atomic expressions
// Check constants first (before identifiers) since constants are also valid identifiers
atom = {
    constant | identifier | "(" ~ expr ~ ")"
}

// Type expressions: e, t, e -> t, (e -> t) -> t
type_expr = {
    type_atom ~ ("->" ~ type_expr)?
}

type_atom = {
    "(" ~ type_expr ~ ")" |
    "e" |  // Entity
    "t"    // Truth
}

// Identifiers (variable names)
identifier = @{ ASCII_ALPHANUMERIC+ }

// POS constants
constant = @{
    "N" | "V" | "Det" | "Adj" | "Adv" | "Prep" | "Conj" |
    "Cop" | "Modal" | "Aux" | "To" | "Dot" | "Prefix"
}

WHITESPACE = _{ " " | "\t" | NEWLINE }
NEWLINE = _{ "\n" | "\r\n" | "\r" }