Parser generator

Published on 10/10/2026

  • For LL(1) grammer stored as array of strings, generate a recursive descentant parser
  • The software will be a meta program - one generating another program as its output
  • Grammer should be written carfully, without left recursion etc.
  • If couldn’t handle, put call a TODO() function. For example when grammer is ambigous
  • It can be a predictive parser, without backtracking. Still it will be useful
  • Result would be efficient, simple and editable
made with ♥️