awesome-repositories.com
Blog
MCP
awesome-repositories.com

Discover the best open-source repositories with AI-powered search.

ExploreCurated searchesOpen-source alternativesSelf-hosted softwareBlogSitemap
ProjectMCP serverAboutHow we rankPress
LegalPrivacyTerms
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
lotabout avatar

lotabout/write-a-C-interpreter

0
View on GitHub↗

Write A C Interpreter

This project is a C language interpreter and a practical implementation of a programming language. It parses and executes C source code directly, removing the requirement for a separate compilation step.

The interpreter is designed for self-hosting, meaning it is capable of interpreting its own source code to demonstrate recursive language processing and execution.

The system covers the primary stages of language processing, including lexical analysis, recursive descent parsing, and tree-walk interpretation using an abstract syntax tree. It manages memory and scope through a dynamic symbol table.

AI search

Explore more awesome repositories

Describe what you need in plain English — the AI ranks thousands of curated open-source projects by relevance.

Start searching with AI

Features

  • C Interpreters - Builds a working interpreter for the C programming language that parses and executes source code directly without compilation.
  • Recursive Descent Parsers - Parses source code by walking through grammar rules using mutually recursive functions.
  • Interpreter Symbol Tables - Manages variable scopes and memory allocation using a runtime symbol table that supports nested scopes and lookup.
  • Interpreter Memory Managers - Handles variable storage and scope lifecycle dynamically during program execution without a separate compilation step.
  • Self-Hosting Interpreters - Designed so the interpreter can parse and execute its own source code, enabling recursive language processing.
  • Lexical Tokenizers - Converts raw source text into a stream of tokens using a hand-written lexer before parsing begins.
  • Source Code Lexical Analyzers - Breaks down source code into tokens and builds an abstract syntax tree using recursive descent parsing techniques.
  • Tree-Walking Interpreters - Evaluates programs by walking an abstract syntax tree at runtime, managing memory and scope through a dynamic symbol table.
  • Syntax Tree Construction - Builds a tree representation of program structure during parsing for subsequent evaluation.
  • Compiler And Interpreter Construction - A guide to building a C language interpreter.
  • Programming Languages - Tutorial for building a C interpreter from scratch.
  • Software Development - Practical guide to building a C language interpreter.
4,343 stars·762 forks·C·gpl-2.0·24 views

Star history

Star history chart for lotabout/write-a-c-interpreterStar history chart for lotabout/write-a-c-interpreter

How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.

Projects sharing features with Write A C Interpreter

These projects share indexed features with Write A C Interpreter. Shared tags can include platform or build tooling; verify the primary use case before treating a result as a replacement.
  • jquery/esprimajquery avatar

    jquery/esprima

    7,139View on GitHub↗

    Esprima is a JavaScript parser that converts source code into a structured abstract syntax tree. It implements a specification-driven grammar to ensure compliance with ECMAScript standards, enabling the programmatic analysis and transformation of JavaScript programs. The project provides capabilities for lexical tokenization to break source code into individual symbols and static syntax validation to verify that scripts are well-formed without executing the code. Its functional surface covers JavaScript static analysis, lexical analysis, and the generation of abstract syntax trees.

    TypeScript
    View on GitHub↗7,139
  • doctorwkt/acwjDoctorWkt avatar

    DoctorWkt/acwj

    13,235View on GitHub↗

    This project is a compiler development tutorial that provides a series of guides and exercises for building a complete compiler from scratch. It focuses on the implementation of a structured compilation pipeline to transform high-level source code into executable machine instructions. The project covers the creation of a machine code generator for specific processor architectures and a static analysis framework. This framework includes methodologies for implementing type checking and constant folding to verify logic correctness before the final execution phase. The instructional material enc

    Cccompilerlexical-analysis
    View on GitHub↗13,235
  • acornjs/acornacornjs avatar

    acornjs/acorn

    11,402View on GitHub↗

    Acorn is a JavaScript parser that converts source text into a structured abstract syntax tree. It follows the ESTree specification to produce a standardized JSON tree format, enabling consistent analysis of code structure and language versions. The project features a plugin-based grammar extension system that allows the base parser to be extended with custom rules for experimental or non-standard language features. It also includes syntax error recovery, which inserts placeholder nodes into the tree when encountering invalid code to allow parsing to continue. The toolset covers static analys

    JavaScript
    View on GitHub↗11,402
  • dullabs/bhai-langDulLabs avatar

    DulLabs/bhai-lang

    4,100View on GitHub↗

    Bhai-lang is a TypeScript-based toy programming language and custom syntax interpreter. It functions as an educational language implementation designed to demonstrate core concepts of variable management, conditional logic, and execution flow. The project provides a custom command line interface and an interactive code playground for writing and testing scripts. It serves as a framework for programming language prototyping, allowing for the definition of custom syntax and execution logic. The system covers the full interpreter pipeline, including lexical analysis, recursive descent parsing,

    TypeScriptinterpreterjavascriptparser
    View on GitHub↗4,100
Compare all 30 related projects→

Frequently asked questions

What does lotabout/write-a-c-interpreter do?

This project is a C language interpreter and a practical implementation of a programming language. It parses and executes C source code directly, removing the requirement for a separate compilation step.

What are the main features of lotabout/write-a-c-interpreter?

The main features of lotabout/write-a-c-interpreter are: C Interpreters, Recursive Descent Parsers, Interpreter Symbol Tables, Interpreter Memory Managers, Self-Hosting Interpreters, Lexical Tokenizers, Source Code Lexical Analyzers, Tree-Walking Interpreters.

Which projects share features with lotabout/write-a-c-interpreter?

Projects with overlapping indexed features include: jquery/esprima — Esprima is a JavaScript parser that converts source code into a structured abstract syntax tree. It implements a… doctorwkt/acwj — This project is a compiler development tutorial that provides a series of guides and exercises for building a complete… nikic/php-parser — PHP-Parser is a tool that converts PHP source code into an abstract syntax tree for static analysis and programmatic… acornjs/acorn — Acorn is a JavaScript parser that converts source text into a structured abstract syntax tree. It follows the ESTree… dullabs/bhai-lang — Bhai-lang is a TypeScript-based toy programming language and custom syntax interpreter. It functions as an educational… doctrine/lexer — This project is a regular expression lexer library and lexical analysis engine used to break input strings into typed…