Tokenizer & Parser: custom compiler featuring a lexical analyzer (tokenizer), recursive-descent parser, and programmatic symbol table for validating BNF (Backus-Naur Form) grammar rules. [Assigment for COSC-A361, Chapter 4-Lexical Syntax Analysis]
Python implementation of fundamental algorithmic problems exploring subprogram design, array manipulation, matrix row reversal, and basic sorting algorithms. [Assignment for COSC-A361, Chapter 9-Subprograms]
Python implementation for solving Knight's Tour mathematical problem on using Warnsdorff's heuristic algorithm.
Add a description, image, and links to the cosc-a361 topic page so that developers can more easily learn about it.
To associate your repository with the cosc-a361 topic, visit your repo's landing page and select "manage topics."