The ARF programming language
This repository has been archived on 2024-02-27. You can view files and clone it, but cannot push or open issues or pull requests.
Go to file
Sasha Koshka 856d5763d3 Lexer tokens are now created by the lexer
This is so positional information can be accurately embedded into them.
2022-08-12 14:34:07 -05:00
arfc Replaced all occurences of github.com with git.tebibyte.media 2022-08-12 10:21:36 -05:00
examples
file Lexer tokens are now created by the lexer 2022-08-12 14:34:07 -05:00
lexer Lexer tokens are now created by the lexer 2022-08-12 14:34:07 -05:00
parser Added expect and nextToken methods to parser 2022-08-12 13:33:21 -05:00
tests Created basic test for parser 2022-08-12 11:55:17 -05:00
types Fixed PermissionFrom() 2022-08-11 03:52:16 -05:00
.gitignore
go.mod Replaced all occurences of github.com with git.tebibyte.media 2022-08-12 10:21:36 -05:00
LICENSE
main.go Replaced all occurences of github.com with git.tebibyte.media 2022-08-12 10:21:36 -05:00
README.md Check off lexer in readme 2022-08-11 18:37:00 -05:00

ARF

The ARF programming language.

This is still under development and does not compile things yet. Once complete, it will serve as a temporary compiler that will be used to write a new one using the language itself.

The old repository can be found here.

ARF is a low level language with a focus on organization, modularization, and code clarity. Behind it's avant-garde syntax, its basically just a more refined version of C.

A directory of ARF files is called a module, and modules will compile to object files (one per module) using C as an intermediate language (maybe LLVM IR in the future).

Design aspects

These are some design goals that I have followed/am following:

  • The standard library will be fully optional, and decoupled from the language
  • The language itself must be extremely simple
  • Language features must be immutable (no reflection or operator overloading)
  • Data must be immutable by default
  • Memory not on the stack must be allocated and freed manually
  • Language syntax must have zero ambiguity

Planned features

  • Type definition through inheritence
  • Struct member functions
  • Go-style interfaces
  • Generics
  • A standard library (that can be dynamically linked)

Checklist

  • File reader
  • File -> tokens
  • Tokens -> syntax tree
  • Syntax tree -> semantic tree
  • Semantic tree -> C -> object file
  • Figure out HOW to implement generics
  • Create a standard library