Automata generators for multiple input types (regular expression, right linear grammar etc.)
-
Updated
Apr 19, 2014 - C++
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
Automata generators for multiple input types (regular expression, right linear grammar etc.)
Expression Calculator using Top Down Derivation
Homeworks for 'formal languages and grammars' discipline
Infer syntactic context-free grammar of an application's input
Memory Layout Manager for Linker Scripts
A very simple and lightweight programming language written for educational reasons. It is interpreted and aims to provide the best of Java, C# and C++.
一个C-的编译器/NUAA 编译原理课程设计
NatLang is an English parser with an extensible grammar
This is a project me and @jovanovic16942 have done for Compiler Construction course (2018) at Computer Science Department of Faculty of Mathematics, University of Belgrade in Serbia. Its general purpose is to preview some basic statistics of arbitrary C code.
The AFP Library is a collection of C++11 header files that provides users with a flexible rapid prototyping tool to create general-purpose LL(k) parsers in C++.
Syslog grammar parser implemented with Boost.Spirit
basic mathematical expression interpreter
Programming language research and translation framework from my high school years. See my "ari" repository for an updated version written in sexy Clojure.[category:cognitive]