Soft test-Basics of programming language (compilation principles)

First of all, I would like to declare that the articles in this series of soft exams are for software designers (intermediate.

In the software designer examination, the previous knowledge about programming languages is very basic, like some knowledge of control structures and data types, I don't think everyone is very skilled in summary in NLP.

This chapter focuses on the compilation principle. The compilation principle refers to a computer program that translates assembly or advanced computer languages into binary machine language code. The content mainly includes grammar, regular expression, finite automatic machine, and syntax guide tree.

Well, I don't want to talk about it. I will introduce the old rules with diagrams.

Let's focus on the compilation principles and look at the first three items.

Grammar is a formal rule that describes the syntax structure;

The regular expression is an expression used to describe words in a program language. It can be converted with some grammar;

Finite automaton is a mathematical method used to describe specific types of algorithms.

With regard to the transition between finite automaton and the regular form, the conversion between DFA and NFA is also required.

 

Let's look at the syntax guide tree and operator first.

I use my own language to explain the phrases, direct phrases, and handles in the syntax guide tree.

 

 

The above is all the content in this chapter. Although the compilation principle does not count much in the soft exam every year, we also need to study it carefully.

Soft test-Basics of programming language (compilation principles)