TOPIC 01
Estimated Time: 4 mins · Video: 03:45
1. Your First Program: The Natural Declaration
Every Enlangg program starts with a domain declaration statement (type enlng). Watch the NotebookLM video briefing below to understand how the compiler tokenizes natural English sentences directly into native C assembly.
Video Briefing: Natural Syntax & Hello World
NotebookLM Video
01_hello_world.enlng
type enlng
// Print to standard console output
display "Hello, Sovereign World!"
display "Enlangg compiles natural English to bare-metal C machine code."
Key Architectural Insights
-
•
type enlngactivates the general-purpose native compiler tier. -
•
display <expr>prints to stdout with zero format string vulnerabilities and no required imports ofstdio.horfmt. - • Zero semicolons, zero header files, and zero boilerplate functions needed to execute code.
TOPIC 02
Estimated Time: 5 mins · Video: 04:30
2. Deterministic Memory Slots & Inferred Types
Unlike garbage-collected languages that pause for heap compaction, Enlangg allocates variables into deterministic stack slots at compile time.
Video Briefing: Memory Slot Invariants
NotebookLM Video
02_memory_slots.enlng
type enlng
// Set allocates slot 0 in the local stack frame
set server_port to 8080
set server_name to "Primary Gateway"
set is_active to true
// Mutate existing slot value with 'set'
set server_port to 9000
display "Server: ", server_name
display "Port: ", server_port
display "Status Active: ", is_active
Key Architectural Insights
-
•
set <id> to <val>is the idiomatic standard to declare and assign variables cleanly. -
•
Enlangg also understands natural synonyms like
let <id> = <val>orcreate <id> as <val>with zero overhead. - • Zero dynamic pointers are exposed, eliminating use-after-free and dangling pointer bugs by construction.
TOPIC 03
Estimated Time: 6 mins · Video: 05:15
3. Spoken Math & Arithmetic Operations
Mathematical calculations read like conversational English clauses: plus, minus, multiplied by, and divided by.
Video Briefing: Spoken Arithmetic Engine
NotebookLM Video
03_spoken_math.enlng
type enlng
set base_salary to 65000
set bonus to 12000
set tax_rate to 0.18
set gross_pay to base_salary plus bonus
set deductions to gross_pay multiplied by tax_rate
set net_pay to gross_pay minus deductions
display "Gross Compensation: ", gross_pay
display "Estimated Tax: ", deductions
display "Net Take-Home: ", net_pay
Key Architectural Insights
-
•
English operators compile directly to single-instruction CPU math (e.g.
fadd,fmul). - • No operator precedence ambiguity; expressions parse strictly from left-to-right unless grouped with parentheses.
TOPIC 04
Estimated Time: 7 mins · Video: 06:00
4. Decision Logic: Spoken Branching & Fallbacks
Replace cryptic symbols like &&, ||, and === with readable English conditional clauses.
Video Briefing: Spoken Branching Rules
NotebookLM Video
04_conditionals.enlng
type enlng
set user_age to 22
set has_verified_id to true
if user_age is greater than or equal to 21 and has_verified_id is equal to true:
display "Access Authorized: Primary Production System"
otherwise if user_age is greater than 16:
display "Access Restricted: Observer Access Only"
otherwise:
display "Access Denied: Age verification requirement not met"
Key Architectural Insights
-
•
Use
is greater than,is less than, andis equal tofor unambiguous comparisons. - • Branches are bounded by clean 4-space indentation; no curly bracket noise required.
TOPIC 05
Estimated Time: 6 mins · Video: 05:40
5. Loops: While, Until & Bounded Iteration
Eliminate off-by-one errors with clear iterative primitives: while loops and deterministic repeat <N> times blocks.
Video Briefing: Iteration Primitives
NotebookLM Video
05_loops.enlng
type enlng
// 1. Spoken while loop
set countdown to 5
while countdown is greater than 0:
display "T-Minus: ", countdown
decrease countdown by 1
display "Ignition sequence complete!"
// 2. Deterministic bounded repeat loop
set accumulator to 0
repeat 4 times:
increase accumulator by 25
display "Bounded accumulator result: ", accumulator
Key Architectural Insights
-
•
repeat <N> timescompiles down to an unrolled or register-counter loop with zero bounds checking penalty. - • Infinite loop safeguards check state invariants at each iteration boundary.
TOPIC 06
Estimated Time: 8 mins · Video: 07:15
6. Procedures, Scopes & Stack Returns
Package your business algorithms into reusable procedures with zero heap allocation overhead. Function frames execute strictly on the stack.
Video Briefing: Procedure Stack Frames
NotebookLM Video
06_procedures.enlng
type enlng
procedure compute_compound_interest with principal, rate, times_per_year, years returns number:
set r_over_n to rate divided by times_per_year
set base to 1 plus r_over_n
set exponent to times_per_year multiplied by years
set factor to math.pow(base, exponent)
return principal multiplied by factor
set investment to compute_compound_interest(10000, 0.07, 12, 10)
display "Projected 10-Year Portfolio Value: ", investment
Key Architectural Insights
-
•
Procedures declare parameters with natural English:
with <args> returns <type>. - • Every procedure is compiled with standard C-calling conventions (cdecl/fastcall).
TOPIC 07
Estimated Time: 8 mins · Video: 06:50
7. Structured Data: Contiguous Lists & Hash Maps
Work with dynamic collections using clean bracket notation. Enlangg implements fast contiguous vectors and Robin Hood hash maps natively.
Video Briefing: Collections Architecture
NotebookLM Video
07_data_structures.enlng
type enlng
// Contiguous dynamic lists
set fruits to ["Apple", "Orange", "Banana"]
call list.append with fruits, "Mango"
display "Total fruits in inventory: ", length of fruits
display "First item: ", fruits[0]
// Key-value hash maps
set telemetry to {
"node_id": "us-east-1a",
"cpu_load": 0.42,
"active_conns": 1280
}
display "Node ID: ", telemetry["node_id"]
display "Current CPU: ", telemetry["cpu_load"]
Key Architectural Insights
- • Lists feature contiguous memory layout with amortized O(1) appends.
- • Dictionaries use cache-friendly hash tables with open addressing.
TOPIC 08
Estimated Time: 10 mins · Video: 08:10
8. The Python God Call & C-ABI Interoperability
Leverage the vast Python and C ecosystem without rewriting libraries. Invoke PyTorch, NumPy, or native OS functions directly via zero-overhead memory bridging.
Video Briefing: Python & C-ABI Interop
NotebookLM Video
08_python_god_call.enlng
type enlng
// Bridge directly into Python 3.10+ runtime via C-ABI
import python module "math" as py_math
import python module "statistics" as stats
set dataset to [12.4, 15.8, 11.2, 19.5, 14.1]
set mean_val to stats.mean(dataset)
set stdev_val to stats.stdev(dataset)
display "Calculated Mean: ", mean_val
display "Standard Deviation: ", stdev_val
Key Architectural Insights
- • Foreign calls pass native C-struct pointers across the FFI boundary with zero serialization overhead.
- • Enables seamless execution of AI/ML workflows while keeping the core application in bare-metal compiled code.