Oberon
1 program
Added 2025-10-22T15:03:50Z
Model: anthropic/claude-4.5-sonnetTemp: 0.4
Evidence
Report issue
View issues
Aliases: Oberon-2, Oberon-07
Provenance: commit c5a5ad1cda · authored 2025-10-22T17:03:50+02:00 · model anthropic/claude-4.5-sonnet
Sources mentioning this language
5 sources · pl_id:
pl/oberonWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | imperative · structured · modular · object-oriented |
|---|---|
| Typing | strong, hybrid (static and dynamic) |
| Designed by | Niklaus Wirth |
| First appeared | 1987 |
| Influenced by | Modula-2 |
| Homepage | https://projectoberon.net |
Extensions claimed by this language
1 claim. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.ob2 | linguist | primary | 7.1K files |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Binary Search Tree Implementation
Provenance: commit c5a5ad1cda · authored 2025-10-22T17:03:50+02:00 · model anthropic/claude-4.5-sonnet · Temp 0.4
MODULE BinaryTree;
IMPORT Out;
TYPE
Tree = POINTER TO Node;
Node = RECORD
data: INTEGER;
left, right: Tree
END;
VAR
root: Tree;
PROCEDURE NewNode(data: INTEGER): Tree;
VAR
node: Tree;
BEGIN
NEW(node);
node.data := data;
node.left := NIL;
node.right := NIL;
RETURN node
END NewNode;
PROCEDURE Insert(VAR t: Tree; data: INTEGER);
BEGIN
IF t = NIL THEN
t := NewNode(data)
ELSIF data < t.data THEN
Insert(t.left, data)
ELSIF data > t.data THEN
Insert(t.right, data)
END
END Insert;
PROCEDURE Search(t: Tree; data: INTEGER): BOOLEAN;
BEGIN
IF t = NIL THEN
RETURN FALSE
ELSIF data = t.data THEN
RETURN TRUE
ELSIF data < t.data THEN
RETURN Search(t.left, data)
ELSE
RETURN Search(t.right, data)
END
END Search;
PROCEDURE InOrder(t: Tree);
BEGIN
IF t # NIL THEN
InOrder(t.left);
Out.Int(t.data, 4);
InOrder(t.right)
END
END InOrder;
PROCEDURE PreOrder(t: Tree);
BEGIN
IF t # NIL THEN
Out.Int(t.data, 4);
PreOrder(t.left);
PreOrder(t.right)
END
END PreOrder;
PROCEDURE PostOrder(t: Tree);
BEGIN
IF t # NIL THEN
PostOrder(t.left);
PostOrder(t.right);
Out.Int(t.data, 4)
END
END PostOrder;
BEGIN
root := NIL;
Insert(root, 5);
Insert(root, 3);
Insert(root, 7);
Insert(root, 1);
Insert(root, 4);
Insert(root, 6);
Insert(root, 9);
Out.String("In-order: "); Out.Ln;
InOrder(root); Out.Ln;
Out.String("Pre-order: "); Out.Ln;
PreOrder(root); Out.Ln;
Out.String("Post-order: "); Out.Ln;
PostOrder(root); Out.Ln;
IF Search(root, 4) THEN
Out.String("Found 4"); Out.Ln
END;
IF ~Search(root, 8) THEN
Out.String("8 not found"); Out.Ln
END
END BinaryTree.