PuqiAR
7ddf03d4c9
[Fix] 修复builtin type的方法可能会导致 bad_variant_access的问题。现在Function严格区分3中函数：
Normal, Builtin, MemberType
[Feat] 增加了 Repl! 通过 Fig -r/--repl进入。目前必须写分号，且异常产生时因为获取不到源文件会有意想不到的问题 :(
[Impl] 精简了Context类，减少内存占用。当然，一些内置函数名获取不了了
后续的 Fig lang standard (目前还没有)中内置函数(MemberType/Builtin)严格无异常抛出
[Feat] 写了个Simple Compiler 和 Bytecode VM作为测试。性能拉跨。优化目前停止
[...] 剩下的忘了~
Fig Language - A Modern Scripting Language
Fig-Gitea Recommend view on Gitea Endpoint
Fig is a statically-typed, expression-oriented programming language designed for clarity, safety, and modern development practices. With features inspired by Go, Rust, and JavaScript, Fig aims to provide a productive development experience while maintaining strong type safety.
Features
🚀 Core Language Features
- Static typing with type inference - Strong typing with minimal annotations
- Modern control flow - Full
forloop support with proper scoping - First-class functions - Lambda expressions and closures
- Rich data structures - Structs, lists, maps, and tuples
- Memory safety - No null pointer exceptions, automatic memory management
🔧 Technical Highlights
- Three-level scoping for loops - Proper variable isolation in iterations
- Smart semicolon handling - Flexible statement termination with RAII guards
- Comprehensive error handling - Detailed error messages with source locations
- Clean C++ implementation - Modern C++23 with RAII and smart pointers
🔧 Install
Installation
Prerequisites
Xmake version 3.0.0 or higher must be installed on your system.
Build Instructions
- Clone the repository:
git clone https://github.com/PuqiAR/Fig.git
- Navigate to the project directory:
cd Fig
- Build the project:
xmake build Fig
- Run the program:
xmake run Fig [file]
Replace [file] with the path to your input file.
Language Philosophy
Fig is designed around several core principles:
Clarity over cleverness - Code should be readable first
Safety by default - Prevent common errors at compile time
Modern ergonomics - Developer experience matters
Gradual learning - Simple to start, powerful when needed
Performance Summary
Version: 0.4.2-alpha (Tree-walker Interpreter)
Test Hardware: i5-13490F, Windows 11
Execution Times for Fibonacci(30):
- Naive Recursion: 11.72s
- Memoization: 0.93ms (12,600× faster)
- Iteration: 0.37ms (31,300× faster)
- Tail Recursion: 0.40ms (29,200× faster)
Visual Comparison:
Naive Recursion : ████████████████████████████████████████ 11.72s
Memoization : ▉ 0.93ms
Iteration : ▍ 0.37ms
Tail Recursion : ▎ 0.40ms
Key Insight: Algorithm choice dominates performance in this tree-walker implementation.
Detailed Reports: English | 中文
Language Documents
see ./docs/en_US/...
We're looking for translators to help translate our project and make it accessible to more language communities.