A Kind of Syntax Parsing Algorithm Based on The Recursive Subroutines
Haili Luo · 2023
If the Context free grammar is belong to LL(1) grammars, the recursive subroutine should be established for each non-terminal of the grammar, the funtion of which is to recogonize the sting which can be deduced from the non-terminal. Based on the recursive subroutines, the syntax parsing algorithm can be established. Using the syntax parsing algorithm based on the recursive subroutines, the syntax analysis can be accomplished.