Compiler applied to high-speed digital I/O wave engines

Abstract

The invention discloses a small compiler applied to high-speed digital I / O wave engines. The processing of the compiler is divided into three steps, i.e. identification and classification of keywords and variables, syntax check and code optimization and generation of target codes. In the first step, the form of a linked list is adopted to record the appearing sequence of keywords and specific symbols, and the parameters of the keywords are recorded in an array; the array is converted into a linked list in the second step, so that space occupation can be reduced; and target codes are generated according to the pop of the linked list. The compiler can simplify the compiling process, the size of the compiler is reduced, and resources used in the compiling process can be flexibly applied, and cannot be wasted; moreover, because the compiler can be arranged in a lower computer, the compilation-downloading process of an upper computer is dispensed with, the overhead is reduced, and the debugging time is shortened.

Description

technical field [0001] The invention belongs to the field of software compilation algorithms, in particular to a small compiler applied to a high-speed digital IO waveform engine. Background technique [0002] In the traditional sense, instrument manufacturers provide users with control programs or drivers in units of functions and attributes. These functions and attributes are focused on realizing one or several specific functions, and users can only use the control methods provided by the manufacturer. Instead, the lower-level functions cannot be combined arbitrarily according to their own needs, which limits the user's usage methods and cannot meet the higher-level needs of users. For example, users need to use the original functions provided by the high-speed digital IO module to realize multiple waveforms with multiple markers, satisfy multiple trigger conditions at the same time, and realize N-level loop nesting and conditional branching, which is almost impossible to ...

AI Technical Summary

Problems solved by technology

[0005] 1. In the process of executing these steps, structural variables such as stacks, linked lists, and binary trees will be generated. A large amount of memory space is required to store these variables. Most of these resources need to be pre-applied. Too long or too short code written by the user will cause space waste

[0006] 2. It is necessary to complete the program compilation through the upper computer before sending it to the lower computer for execution through the bus. This is because the above process has high requirements for speed and space, and the lower computer generally cannot provide enough resources required by the above steps to complete the compilation process.

[0007] 3. There are many links in the traditional compilation process, and they are executed sequentially. The input of the next step depends on the output of the previous step. If the result of the previous step does not conform to the rules defined by the grammar, the next step will not be executed normally. , at this time the environment will stop compiling and return an error

Such cumbersome operations are for the stability of the entire IDE environment, but for the user, it is equivalent to adding a lot of restrictions, and the user is unable to intervene after the error is reported in the later steps, and even confused

Images