Pseudocode · macOS and iOS
PseudoLearn runs your pseudocode one statement at a time and keeps the same step highlighted in the code, the flowchart, the structogram and the trace table. Behind it sits a 15-module path with 95 self-checking exercises.
macOS 13 or later · Apple Silicon and Intel · iOS 16 or later · Works offline
Availability
Synchronized views
Almost nobody learns to program by reading a flowchart drawn by hand on a separate sheet. In PseudoLearn the four surfaces are projections of the same program, generated by the engine: when the interpreter advances, the highlight moves in all of them at once. There is also a UML class diagram when the program uses objects.
01 · Code
temperature <- 30; readings <- 0; While temperature > 24 Do temperature <- temperature - 3; readings <- readings + 1; Write "Reading ", readings; EndWhile
The statement being executed gets its own background and its number lights up in the gutter, with no cursor to hunt for.
02 · Flowchart
Drawn by the engine from the syntax tree: the shape says what the node does and the loop return uses the brand colour.
03 · Structogram
¿temperature > 24?
temperature <- temperature - 3
readings <- readings + 1
Write "Reading ", readings
Nassi-Shneiderman: no arrows and no jumps, the block structure is the box itself.
04 · Trace table
| Step | Line | temperature | readings |
|---|---|---|---|
| 2 | 3 | - | - |
| 3 | 4 | 30 | - |
| 4 | 5 | 30 | 0 |
| 5 | 6 | 30 | 0 |
| 6 | 7 | 27 | 0 |
The table your teacher asks you to fill in by hand, filled in by the interpreter. With object identity and aliasing when there are any.
Learning path
Fifteen modules across three stages, written to be read in that order. Each module explains one idea, shows it running and closes with exercises the app checks against visible and hidden cases.
Before writing anything: what a sequence of steps must satisfy to be called an algorithm, and the notional machine you will reason with for the rest of the path.
The bulk of the path: data, decisions, the three loops and when each one applies, arrays, subprograms and recursion. It closes by reading programs from their diagram.
From loose variables to a thing with state and behaviour. It includes the point where almost everyone gets lost: identity, aliasing and what really happens when you copy an object.
Why this and not a notebook
The interpreter advances one statement at a time and you choose the speed. The focus moves at once in the code, the diagrams and the trace table, so you never have to guess where you are.
Every diagnostic marks its exact span and the related spans too — the missing declaration, the extra EndWhile — as you type, not at the end.
The equivalent-code tab projects your program into two industrial languages, line by line, so you can see the correspondence before making the jump to one of them.
The trace table shows the identity of each instance (Account#1) and does not collapse aliases. Seeing two names pointing at the same object settles in one step what a paragraph cannot.
They are saved as .pseudo plain text, on your disk. The app works fully offline; the account and sync are optional, not an entry toll.
The reserved words, the knowledge base, the exercises and the diagnostics all exist in both languages. Switching language changes the language, not just the buttons.
Downloads
In progressWindows, Linux and Android. No announced date: they will be published here when they are ready, not before.
By the time you finish the second one you will have run an algorithm step by step and read its trace table. From there, the rest of the path makes sense.
Also on the App Store for iPhone and iPad