Hi Daniel - I'm just going over some stuff & wonder if you could please give me recap of the uses & differences between the compile_process vectors: node_vec & node_tree_vec ? Cheers, Tim.
Hi Tim,
Yes sure, node_tree_vec is the root of our tree, so you can imagine C functions being in here, C global variables and so on. What it wont contain are things like if statements because if statements have a parent node right. Anything that cant have a parent node you can expect to end up in the node_tree_vec.
node_vec is used during the parsing process as a way to push and pop things, so if we find 50 we push to the node_vec we find + we push to the node vec, we find 20 we push to the node vec. Pop it all off and then create an expression node then push that back to the node_vec. So that is what the node_vec is used for, to assist during the parsing operation. When parsing is done we iterate through the node_tree_vec which contains everything we care about.
Learn to create your very own C compiler from scratch. In this course we develop a compiler that compiles a subset of the C Programming Language. By the time you finish all modules of this course you will be able to compile C programs that use pointers, structures, unions, arrays, functions, for loops, while loops. do while loops, if statements, switches and much more! This course includes all course modules!
Our compiler also has a preprocessor macro system allowing you to include header files and create definitions just like you would in any C file.
Your compiler is advanced enough to use the GCC standard library so we are able to call C functions from our compiler. Your compiler will be able to compile the C programming language.
This course does not rely on any frameworks we do everything from scratch to ensure the best possible learning experience for students
Module 1
In module 1 of this course we load our C source file that we wish to compile, into memory. We create a lexer to preform lexical analysis on the source input which will convert the source code into a bunch of tokens that our compiler can easily understand. We then pass the tokens through a parser to produce an abstract syntax tree. An AST describes the C program in a logical way that makes it easier for our compiler to understand. For example for the expression 50 + 20 you will end up with a root expression node that has a left operand that has a node of value 50 and a right operand that has a node of value 20. Breaking down problems in this way makes it much easier to create compilers.
Module 2
In module 2 of this course we create a code generator that produces 32 bit Intel assembly language that can then be passed through an assembler to produce a program binary that we can run. We also in this module create a resolver system which is responsible for taking a complicated expression such as "a->b.c.e[50] = 50" and breaking it down into simple steps and rules that our code generator can then easily follow. This abstraction is essential to ensure that the code generator does not become over complex. With the use of a resolver system we can ensure the code base remains clean.
Module 3
In module 3 of this course we create a preprocessor and macro system. This preprocessor system allows us to include header files in our C programs and also use a variety of macro keywords such as "#define" "#ifdef" , "sizeof" and many more.
Module 4
In module 4 we build a semantic validator which validates our C code. A semantic validator ensures that we are not setting variables that do not exist or accessing structures that arent there.
This is the only video course in the world that shows you how to create a C compiler, come and learn today!
Requirements
You must have a basic experience of assembly language.
Who This Course is For
People with an interest in compiler design
People who are interested in assembly language
People who are interested in the C Programming language
What You Will be Learn
How to build a C compiler from scratch
Full understanding of stackframes and how assembly language is generared for a C source file
Complete Understanding of lexical analysis and parsing
Daniel McCarthy is a seasoned software engineer, boasting an impressive career spanning over 14 years in the industry. Holding a Master's Degree in Advanced Computer Science from Cardiff Metropolitan University, his broad spectrum of experience encompasses everything from web development to complex compiler and interpreter development.
Daniel has honed his skills in bootloader and kernel development. In testament to his proficiency in the field, he has designed two proprietary programming languages: Craft, a general-purpose language, and Marble, a web-focused language akin to PHP. Moreover, he has successfully developed compilers for the C programming language.
A testament to his versatility, Daniel demonstrates proficiency in an extensive list of programming languages that includes C, C++, Java, x86 Assembly language, PIC assembly, SQL, PHP, HTML5, JavaScript, CSS, and of course, his own creations, Craft and Marble.
His professional portfolio also includes the development of Linux kernel modules, a task he has executed with proficiency in a professional context. Currently, Daniel is channeling his wealth of experience and expertise into the education sector, with the aim of nurturing the next generation of professional software engineers.
Ask a question
Questions (1)
Timothy Morgan
1 year ago
Hi Daniel - I'm just going over some stuff & wonder if you could please give me recap of the uses & differences between the compile_process vectors: node_vec & node_tree_vec ? Cheers, Tim.
Daniel McCarthy
1 year ago
Hi Tim, Yes sure, node_tree_vec is the root of our tree, so you can imagine C functions being in here, C global variables and so on. What it wont contain are things like if statements because if statements have a parent node right. Anything that cant have a parent node you can expect to end up in the node_tree_vec. node_vec is used during the parsing process as a way to push and pop things, so if we find 50 we push to the node_vec we find + we push to the node vec, we find 20 we push to the node vec. Pop it all off and then create an expression node then push that back to the node_vec. So that is what the node_vec is used for, to assist during the parsing operation. When parsing is done we iterate through the node_tree_vec which contains everything we care about.
Timothy Morgan
1 year ago
That's great - Thanks Daniel.