ToolJovia
Education

FIRST, FOLLOW and LL(1) Table Workbench

Compute nullable symbols, FIRST/FOLLOW sets and real predictive-table conflicts for your explicit token grammar.

✓ Browser-local processing
Processed in this tab. Up to 100,000 characters unless this tool states a smaller limit.

Loading tool…

How to use FIRST, FOLLOW and LL(1) Table Workbench

Inspect the fixed-point evidence needed for a one-token predictive table. Productions remain numbered, epsilon uses an empty right array, and conflicting alternatives stay visible instead of being overwritten by a guessed winner.

  1. Enter input.
  2. Choose the settings for first, follow and ll(1) table workbench, then run the tool.
  3. Review the result and any limitations before copying or downloading it.

Good to know

  • 20 nonterminals, 50 terminals, 100 productions, 20 symbols per right side, 30 characters per symbol and 2,000,000 bounded work units. Browser computation uses an isolated module worker with a 2-second compute deadline after startup.
  • Terminals are symbols never used on a left side. Literal $ and ε are reserved; duplicate productions are refused. This generates data, not executable parser code, and does not silently remove left recursion or rewrite the grammar.
  • Processing is local. Output is limited to 1,000,000 text characters unless a stricter file limit is stated.

Common questions

Why do conflicts retain several production numbers?

A predictive table cell needs one choice. If two alternatives occupy the same cell, choosing either silently would hide the actual lookahead conflict.

Is this input sent to a server?

No. The application processes this input inside your browser tab and does not save it to persistent storage.

Keep going with related tools

All education →
Education

Explicit Epsilon-NFA Workbench

Simulate finite token strings or build a reachable deterministic transition table from a supplied epsilon-NFA.

Education

Boolean Truth Table Workbench

Enumerate bounded propositional truth tables and find real counterexamples to formula equivalence.

Education

Forward Propositional Derivation Checker

Check explicit local inference steps and their earlier-line references without treating a plausible conclusion as a proof.

Developer

State Transition Test Suite Builder

Build reset-to-start source test sequences covering every reachable transition in a declared deterministic state graph.