The Conlang programming language is an expression-based interpreted (todo: compiler) language
Go to file
John 8c0ae02a71 sample-code/ascii.cl: Make it cooler
- Compute char value of digit
- Substitute C0 control codes for Unicode C0 Control Pictures
- Extend through Unicode Latin-1 Supplement
- Blank out C1 control code range
2024-07-27 19:34:37 -05:00
.gitea/issue_template gitea: update feature-proposal.md 2024-03-01 03:13:07 -06:00
compiler cl-interpret/builtin: Add len builtin as a quick hack to write more interesting programs. 2024-07-27 18:43:03 -05:00
repline repline: Document the editor 2024-07-12 16:40:32 -05:00
sample-code sample-code/ascii.cl: Make it cooler 2024-07-27 19:34:37 -05:00
stdlib cl_typeck: Add new primitive types (including joking-point numbers) 2024-07-26 03:24:34 -05:00
.gitignore Update .gitignore 2024-04-13 03:38:32 -05:00
.rustfmt.toml .rustfmt.toml: Configure rustfmt to be slightly more pretty 2023-09-22 23:55:19 -05:00
Cargo.toml conlang: Bump version to v0.0.6 2024-07-25 05:56:05 -05:00
dummy.cl parser: Mockup type-expression syntax 2023-10-30 00:07:27 -05:00
grammar.ebnf conlang: Introduce as casting 2024-07-26 05:26:08 -05:00
LICENSE.md Add LICENSE 2023-10-23 21:05:51 -05:00
readme.md Update readme.md 2024-04-22 02:06:46 -05:00

Conlang: Expression-Oriented Programming Language

This project began out of a desire to merge Rust-style control flow expressions with Python's fun for-else/while-else syntax. I fully intend to devote my spare time to conlang for the forseeable future.

Immediate Goals:

  • Decide on a minimal set of keywords and operators to support
  • Lex an entire Rust source file (minus generics, paths, and lifetimes)
  • Write expression grammar
  • Write AST for expression grammar
  • Write parser for AST
  • Create tests for parser (and AST)
  • Parse dummy.cl into a valid AST
  • Pretty printer, for debugging
  • Create minimal statement grammar
    • Variable definition statements
    • Function definition statements

Short Goals:

  • for loops and while loops can be used on the trailing side of an assignment
  • Tree-walk interpreter for prototyping and debugging
  • Data structures and sum-type enums
  • Expression type-checker
  • Pattern destructuring, to take advantage of sum-type enums
  • Three-address bytecode VM for standard library development
  • Trait/Interface system

Long Goals:

  • Minimize the number of kinds of statements
  • Compile to LLVM IR
  • Create a standard library for the language, with Rust-like abstractions.
  • Port the compiler to Conlang