LQ Programming Language

Apologies for the gap since the last post.

The most common objection to visual programming languages is the spaghetti problem.

Earlier posts introduced forEach as a way to iterate an array — attach a forEach terminal and the node executes once per element.

> Apologies for the gap between posts.

Previous posts covered how data flows through graphs and how closures provide control flow.

The previous post ended with a claim: control flow in LQ is just methods that accept closures.

The previous tutorial ended with a teaser — a compressed version of the printPerson method where a string literal physically touched a println node, merging into a single compact structure.

Previous posts introduced the idea behind LQ — a diagrammatic dataflow language where the program is the graph.

Let the Robots Speak introduced LQ — a visual dataflow language designed for AI agents.

Foreword I’ve been thinking about writing another diagrammatic language since my work on Prograph in the 1980s.

It happened in the shower, or on a walk, or staring at a whiteboard with a dried-out marker in your hand.

This method constructs a map and performs operations on that map.

The first node is a multiline text node, no quotes required.

You’re a neural network.

Why the future of programming looks nothing like a text file It’s 2026, and we’re still typing if (x > 0) { return true; } into monospaced text editors like it’s a teletype terminal in 1957.