Backtracking

Kelbt project can generate backtracking LALR parsers. Standard LALR parser generators emit an error upon encountering a conflict in the parse tables. Kelbt forges onward, generating parsers which handle conflicts by backtracking at runtime. Kelbt is able to generate a parser for any context-free... Platforms: *nix

This is a fun little app that is more educational than anything else, unless you love to solve mazes. This game may stretch your mind and give you an intellectual workout like chess and texas holdem. It has random maze creation, maze solving and pathfinding, and more, all while taking the time to... Platforms: Mac

LEPL is a parser library for Python 2.6 and 3.0 with recursive descent and full backtracking. #md5=694bdd7d25d6ca4d69ead16587b227a4 Platforms: *nix

A Sudoku Solver in C is a console-based Linux program, written in C language, that solves Su Doku puzzles using deductive logic. It will only resort to trial-and-error and backtracking approaches upon exhausting its deductive moves. Puzzles must be of the standard 9x9 variety using the (ASCII)... Platforms: *nix

Rats! is an easily extensible parser generator for C-like languages; though currently it only generates parsers in Java. Rats! project has been explicitly designed so that grammars are concise and easily modifiable. To this end, Rats! - organizes grammars into modules, - builds on parsing... Platforms: *nix

JSudoku is a Java version of the game Sudoku. A backtracking algorithm cares for random puzzles and based on the Sudoku-Puzzle JavaScript. Optionally, JSudoku generates X-Sudoku puzzles. Platforms: Windows, Mac, Linux