aboutsummaryrefslogtreecommitdiff
path: root/asm/parser.h
blob: a8748d0fe4493810564bf0acfb76bf80fc6eda08 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/* Copyright (C) 2023 Aryadev Chavali

 * You may distribute and modify this code under the terms of the
 * GPLv2 license.  You should have received a copy of the GPLv2
 * license with this file.  If not, please write to:
 * aryadev@aryadevchavali.com.

 * Created: 2023-10-24
 * Author: Aryadev Chavali
 * Description: Parser for assembly language
 */

#ifndef PARSER_H
#define PARSER_H

#include "./lexer.h"

#include <lib/inst.h>

typedef enum
{
  PERR_OK = 0,
  PERR_INTEGER_OVERFLOW,
  PERR_NOT_A_NUMBER,
  PERR_EXPECTED_UTYPE,
  PERR_EXPECTED_TYPE,
  PERR_EXPECTED_SYMBOL,
  PERR_EXPECTED_LABEL,
  PERR_EXPECTED_OPERAND,
  PERR_PREPROCESSOR_EXPECTED_NAME,
  PERR_PREPROCESSOR_EXPECTED_END,
  PERR_PREPROCESSOR_UNKNOWN_NAME,
  PERR_INVALID_RELATIVE_ADDRESS,
  PERR_UNKNOWN_OPERATOR,
  PERR_UNKNOWN_LABEL,
} perr_t;

const char *perr_as_cstr(perr_t);

// TODO: Refactor parser.c
typedef struct
{
  inst_t instruction;
  s_word address;
  struct PLabel
  {
    char *name;
    size_t size;
  } label;
  enum PResult_Type
  {
    PRES_LABEL = 0,
    PRES_LABEL_ADDRESS,
    PRES_GLOBAL_LABEL,
    PRES_RELATIVE_ADDRESS,
    PRES_COMPLETE_RESULT,
  } type;
} presult_t;

// TODO: Implement these
presult_t presult_label(const char *, size_t, s_word);
presult_t presult_label_ref(inst_t, const char *, size_t);
presult_t presult_instruction(inst_t);
presult_t presult_relative(inst_t, s_word);
presult_t presult_global(const char *, size_t, s_word);
void presult_free(presult_t);
void presults_free(presult_t *, size_t);

typedef struct
{
  char *name;
  size_t name_size;
  word addr;
} label_t;

label_t search_labels(label_t *, size_t, char *, size_t);

typedef struct
{
  char *name;
  size_t name_size;
  darr_t code;
} block_t;

block_t search_blocks(block_t *, size_t, char *, size_t);

// Analyses then inlines corresponding tokens into stream directly
perr_t preprocessor(token_stream_t *);
// Parses from the preprocessed stream
perr_t parse_next(token_stream_t *, presult_t *);
// Deals with address building
perr_t process_presults(presult_t *, size_t, prog_t **);
perr_t parse_stream(token_stream_t *, prog_t **);

#endif