Compare commits

..

No commits in common. "d244cfbfe10095fb7d289817c9f87e46e255fb65" and "aae84024034c65b5a37183a4240be148c2d350cd" have entirely different histories.

12 changed files with 99 additions and 56 deletions

View File

@ -1,3 +1,16 @@
# SCL: Simple Calculator Language
A rewrite of halk.
Project structure:
```bash
$ tree -d
.
├── build # Build directory; where binaries (except the main one) go.
│   ├── obj # Project objects.
│   └── test # Test build directory.
│   └── obj # Test objects.
├── src # Source files (*.c).
│   └── include # Header files (*.h)
└── test # Tests (file names match those in src/*.c).
└── unity # Unity test framework files.
```

View File

@ -8,20 +8,20 @@
// What the lexer is currently looking at.
typedef enum {
LEXER_STATE_CONFUSED, // Can't decide what it's looking at (also initial
// state).
LEXER_STATE_NUM, // Looking at a number.
LEXER_STATE_CALL, // Looking at a call.
LEXER_STATE_CONFUSED, // Can't decide what it's looking at (also initial
// state).
LEXER_STATE_NUM, // Looking at a number.
LEXER_STATE_CALL, // Looking at a call.
} LexerState;
// Lexer: converts text to tokens.
typedef struct {
char* src; // The source text.
size_t srcl; // The number of source chars.
char* cchar; // The current character.
Token** tokens; // The tokens produced.
size_t ntokens; // The number of tokens.
LexerState state; // What the lexer is looking at.
char* src; // The source text.
size_t srcl; // The number of source chars.
char* cchar; // The current character.
Token** tokens; // The tokens produced.
size_t ntokens; // The number of tokens.
LexerState state; // What the lexxer is looking at.
} Lexer;
// Create a lexer.
@ -42,7 +42,4 @@ void lexer_do_call(Lexer* lexer);
// Convert text to tokens.
void lexer_lex(Lexer* lexer);
// Add a token to the lexer.
void lexer_add_token(Lexer* lexer, Token* token);
#endif

View File

@ -10,4 +10,21 @@
// - Expression 1
// - Expression 2
typedef enum OpType {
OPTYPE_PLUS,
OPTYPE_MINUS
} optype_t;
typedef union Exp {
typedef struct Op {
optype_t type;
Exp* exp1;
Exp* exp2;
} op_t;
int n;
} exp_t;
#endif

View File

@ -9,7 +9,7 @@ typedef enum {
// Token.
typedef struct {
TokenType type; // The type of the Token.
char* val; // The text of the Token.
char* val; // The text of the Token.
} Token;
Token* token_init(TokenType type, char* val);

12
src/include/util.c Normal file
View File

@ -0,0 +1,12 @@
#ifndef UTIL_H
#define UTIL_H
// Utilies.
#include <stdlib.h>
#include <stdio.h>
// Exit with an error. Returns int for ease of use, but should be treated as void.
int die(char* msg);
#endif

View File

@ -1,6 +1,4 @@
#include "include/lexer.h"
#include "include/token.h"
#include <stdlib.h>
Lexer* lexer_init(char* src) {
Lexer* lexer = malloc(sizeof(Lexer));
@ -22,15 +20,7 @@ void lexer_destroy(Lexer* lexer) {
for (int i = 0; i < lexer->ntokens; token_destroy(lexer->tokens[i++]));
}
void lexer_do_confused(Lexer* lexer) {
int c = atoi(lexer->cchar);
if (c) lexer_add_token(lexer, token_init(TOKEN_TYPE_NUMBER, lexer->cchar));
else lexer_add_token(lexer, token_init(TOKEN_TYPE_CALL, lexer->cchar));
}
void lexer_do_number(Lexer* lexer) {}
void lexer_do_call(Lexer* lexer) {}
void lexer_do_confused(Lexer* lexer) {}
void lexer_lex(Lexer* lexer) {
while (*lexer->cchar) {
@ -42,8 +32,3 @@ void lexer_lex(Lexer* lexer) {
}
}
}
void lexer_add_token(Lexer* lexer, Token* token) {
(void)reallocarray(lexer->tokens, lexer->ntokens++, sizeof(Token));
lexer->tokens[lexer->ntokens-1] = token;
}

View File

@ -1,3 +1,6 @@
#include "include/util.h"
int is_even(int n) { return !(n % 2); }
int is_even(int n) {
return !(n%2);
}

View File

@ -1,5 +1,5 @@
#include "registry.h"
#include "unity/unity.h"
#include "registry.h"
void (*tests[30])();

View File

@ -1,5 +1,5 @@
#include "registry.h"
#include "unity/unity_internals.h"
#include "registry.h"
#define TESTS_MAX 128
@ -7,14 +7,13 @@ static Test tests[TESTS_MAX];
static int test_count = 0;
void register_test(Test t) {
if (test_count < TESTS_MAX) {
tests[test_count] = t;
test_count++;
} else printf("Maximum number of tests (%d) exceeded.\n", TESTS_MAX);
if (test_count < TESTS_MAX) {
tests[test_count] = t;
test_count++;
} else
printf("Maximum number of tests (%d) exceeded.\n", TESTS_MAX);
}
void run_all_tests() {
for (int i = 0; i < test_count; i++) {
int res = tests[i]();
}
for (int i = 0; i < test_count; i++) tests[i]();
}

View File

@ -2,12 +2,12 @@
#define REGISTRY_H
#include <stdio.h>
#include "unity/unity.h"
typedef int (*Test)(void);
// Test functions neither consume nor return anything.
typedef void (*Test)(void);
// Register a new test function.
void register_test(Test);
void register_test(Test t);
// Run all registered tests.
void run_all_tests();

View File

@ -1,19 +1,31 @@
#include "unity/unity.h"
#include <stdlib.h>
#include "unity/unity.h"
#include "../src/include/token.h"
#include "registry.h"
#include "unity/unity_internals.h"
#include "../src/include/token.h"
int test_token_init() {
UNITY_BEGIN();
void test_token_init() {
char* s = malloc(sizeof("Hello, world!"));
s = "Hello, world!";
Token* t = token_init(TOKEN_TYPE_CALL, s);
TEST_ASSERT_EQUAL(TOKEN_TYPE_CALL, t->type);
TEST_ASSERT_EQUAL_STRING("Hello, world!", t->val);
return UNITY_END();
}
void test_token_destroy() {
char* s = malloc(1 * sizeof(char));
*s = 'h';
Token* t = token_init(TOKEN_TYPE_CALL, s);
token_destroy(t);
}
void token_test() {
UNITY_BEGIN();
RUN_TEST(test_token_init);
UNITY_END();
}
__attribute__((constructor)) void register_tests_token() {
register_test(test_token_init);
register_test(token_test);
}

View File

@ -1,14 +1,19 @@
#include "../src/include/util.h"
#include "registry.h"
#include "unity/unity.h"
#include "registry.h"
#include "unity/unity_internals.h"
#include "../src/include/util.h"
int test_is_even() {
UNITY_BEGIN();
void test_is_even() {
TEST_ASSERT_EQUAL(0, is_even(1));
TEST_ASSERT_EQUAL(1, is_even(2));
return UNITY_END();
}
void util_test() {
UNITY_BEGIN();
RUN_TEST(test_is_even);
UNITY_END();
}
__attribute__((constructor)) void register_tests_util() {
register_test(test_is_even);
register_test(util_test);
}