Make it clear that a variable is a pointer.

This file will accept the assembler functions and test cases.

Get binary opcodes from pseudo-assembly output binary file in order

Each directive must have a function, which will execute whatever the directive demands and return the amount of space in memory it occupies.

Must include the system functioning, test cases and all error messages

Directives must have one table to contain its label, address and number of parameters, and another to store its code and variables (changed to #i notation).

Check whether an operand label is in the expression [a-zA-Z0-9_[]](has '[' and ']' besides the label permissions)

This will allow to correct initialize the program if the data section comes before the text section

They must have been in the same table from the beginning. Probably, it will require to implement a whole new table struct.

For example, by ADD, MUL, DIV etc.

Implement a hash table to be the basic table of the assembler, instead of a linked list.

Grammar are basically state machines to extract tokens from the code. With a grammar, it is easy to explicit all the formats that instructions and numbers may have. BNF should be enough.

Check for security and division by zero