The Minimum Viable Programming Language (MVPL) planned to be implemented through a custom lexer, parser, bytecode generator, bytecode interpreter and simple optimizer.
The lexer turns a program like this:
function main()
{
return 0;
}int a token stream like this:
{
"token_stream": [
{
"value": "function",
"type": "FUNCTION",
"source_location_": {
"line_start": 0,
"col_start": 0,
"line_end": 0,
"col_end": 8
}
},
{
"value": "main",
"type": "IDENTIFIER",
"source_location_": {
"line_start": 0,
"col_start": 9,
"line_end": 0,
"col_end": 13
}
},
{
"value": "(",
"type": "LPAREN",
"source_location_": {
"line_start": 0,
"col_start": 13,
"line_end": 0,
"col_end": 14
}
},
{
"value": ")",
"type": "RPAREN",
"source_location_": {
"line_start": 0,
"col_start": 14,
"line_end": 0,
"col_end": 15
}
},
{
"value": "{",
"type": "LBRACE",
"source_location_": {
"line_start": 1,
"col_start": 0,
"line_end": 1,
"col_end": 1
}
},
{
"value": "return",
"type": "RETURN",
"source_location_": {
"line_start": 2,
"col_start": 4,
"line_end": 2,
"col_end": 10
}
},
{
"value": "0",
"type": "LITERAL",
"source_location_": {
"line_start": 2,
"col_start": 11,
"line_end": 2,
"col_end": 12
}
},
{
"value": ";",
"type": "SEMICOLON",
"source_location_": {
"line_start": 2,
"col_start": 12,
"line_end": 2,
"col_end": 13
}
},
{
"value": "}",
"type": "RBRACE",
"source_location_": {
"line_start": 3,
"col_start": 0,
"line_end": 3,
"col_end": 1
}
}
]
}The parser is a recursive descent parser and uses parser combinators with backtracking, and a pratt parser for dealing with operator precedence.
The parser turns a token stream like this:
{
"token_stream": [
{
"value": "function",
"type": "FUNCTION",
"source_location_": {
"line_start": 0,
"col_start": 0,
"line_end": 0,
"col_end": 8
}
},
{
"value": "main",
"type": "IDENTIFIER",
"source_location_": {
"line_start": 0,
"col_start": 9,
"line_end": 0,
"col_end": 13
}
},
{
"value": "(",
"type": "LPAREN",
"source_location_": {
"line_start": 0,
"col_start": 13,
"line_end": 0,
"col_end": 14
}
},
{
"value": ")",
"type": "RPAREN",
"source_location_": {
"line_start": 0,
"col_start": 14,
"line_end": 0,
"col_end": 15
}
},
{
"value": "{",
"type": "LBRACE",
"source_location_": {
"line_start": 1,
"col_start": 0,
"line_end": 1,
"col_end": 1
}
},
{
"value": "return",
"type": "RETURN",
"source_location_": {
"line_start": 2,
"col_start": 4,
"line_end": 2,
"col_end": 10
}
},
{
"value": "0",
"type": "LITERAL",
"source_location_": {
"line_start": 2,
"col_start": 11,
"line_end": 2,
"col_end": 12
}
},
{
"value": ";",
"type": "SEMICOLON",
"source_location_": {
"line_start": 2,
"col_start": 12,
"line_end": 2,
"col_end": 13
}
},
{
"value": "}",
"type": "RBRACE",
"source_location_": {
"line_start": 3,
"col_start": 0,
"line_end": 3,
"col_end": 1
}
}
]
}into an absract syntax tree (AST) like this:
{
"ast": {
"type": "PROGRAM",
"source_location_": {
"line_start": 0,
"col_start": 0,
"line_end": 3,
"col_end": 1
},
"globals": [
{
"type": "FUNC_DEF",
"source_location_": {
"line_start": 0,
"col_start": 0,
"line_end": 3,
"col_end": 1
},
"signature": {
"type": "FUNC_SIGNATURE",
"source_location_": {
"line_start": 0,
"col_start": 9,
"line_end": 0,
"col_end": 15
},
"identifier": "main",
"parameter_list": {
"type": "PARAMETER_DEF",
"source_location_": {
"line_start": 0,
"col_start": 13,
"line_end": 0,
"col_end": 15
},
"parameter_list": []
}
},
"body": {
"type": "BLOCK",
"source_location_": {
"line_start": 1,
"col_start": 0,
"line_end": 3,
"col_end": 1
},
"statements": [
{
"type": "RETURN_STMT",
"source_location_": {
"line_start": 2,
"col_start": 4,
"line_end": 2,
"col_end": 13
},
"value": {
"token": "LITERAL",
"value": "0"
}
}
]
}
}
]
}
}- Functional lexer
- Functional parser
- Functional semantic analyser
- Functional code generator
- Functional interpreter
- Pointer support
- Struct support
- Array support
- Functional Optimizer
Copyright (C) 2021-2022 Jonas Muehlmann
The project is licensed under the terms of the MIT license, you can view it here.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent