Oberon-2
1 program
Added 2025-10-22T15:35:03Z
Model: anthropic/claude-4.5-sonnetTemp: 0.4
Evidence
Report issue
View issues
Aliases: Oberon2
Provenance: commit f89a0550ad · authored 2025-10-22T17:35:03+02:00 · model anthropic/claude-4.5-sonnet
Sources mentioning this language
5 sources · pl_id:
pl/oberon-2Wikipedia 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 | ETH Zurich · Niklaus Wirth Hanspeter Mössenböck |
| First appeared | 1991 |
| Influenced by | Oberon · Modula-2 · Object Oberon |
| Homepage | http://www.ethoberon.ethz.ch |
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 f89a0550ad · authored 2025-10-22T17:35:03+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 tree: Tree; data: INTEGER);
BEGIN
IF tree = NIL THEN
tree := NewNode(data);
ELSIF data < tree.data THEN
Insert(tree.left, data);
ELSIF data > tree.data THEN
Insert(tree.right, data);
END;
END Insert;
PROCEDURE Search(tree: Tree; data: INTEGER): BOOLEAN;
BEGIN
IF tree = NIL THEN
RETURN FALSE;
ELSIF data = tree.data THEN
RETURN TRUE;
ELSIF data < tree.data THEN
RETURN Search(tree.left, data);
ELSE
RETURN Search(tree.right, data);
END;
END Search;
PROCEDURE InOrder(tree: Tree);
BEGIN
IF tree # NIL THEN
InOrder(tree.left);
Out.Int(tree.data, 4);
InOrder(tree.right);
END;
END InOrder;
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 traversal: ");
InOrder(root);
Out.Ln;
IF Search(root, 4) THEN
Out.String("Found 4");
ELSE
Out.String("Not found 4");
END;
Out.Ln;
IF Search(root, 8) THEN
Out.String("Found 8");
ELSE
Out.String("Not found 8");
END;
Out.Ln;
END BinaryTree.