Subject: Compiler Principle

Please give me the source code of this question?

Please read the question carefully don't say this question is incomplete or need more information.

Source Code:

Title Design prioritized operators algorithm parser Requirements: Using C/C++/java language design a prioritized operators parser. The prioritized operators analysis method is used to design an analysis and interpretation program, which performs lexical analysis, syntax analysis and expression evaluation on the input assignment statement, output statement and clear statement, and stores them in the specified variables; If there is an error, you will be prompted with error related information. Content: Example: Grammar S v=EE? | clear E E+TE-TT T + T*FT/F|F F (E) vc Analysis: FIRSTVT(S) = {v,?, clear FIRSTVT(F) = {(.v,c} LASTVT(S)= { ?, clear } LASTVT(F)= (),v,c} FIRSTVT(T) = {*./.(,v,c} FIRSTVT(E) = {+,--*,/.(.v.c} LASTVT(T) = {* ,/.),v,c} LASTVT(E)= {+,-*,/,},v,c} Token: = + * ( 7 ) 8 V 9 5 6 10 ? 2 # 12 1 clear 11 3 N 13 Priority relation table: ? * clearl N + > ? + > > > > > > > > > > > * / ( ) V clear # N VVV > > > > > > > > > > > > > >