Granted Patent B2

US 12,541,350 · App. 18/252,232 · Granted Feb 3, 2026

Inventors: Ruo Li (Beijing, CN); Tiao Lu (Beijing, CN)

Assignees: PEKING UNIVERSITY; PEKING UNIVERSITY CHONGQING RESEARCH INSTITUTE OF BIG DATA

G06F8/425G06F8/31G06F8/427

Abstract

Claims (23)

1 . A method for parsing a programming language, comprising:

converting a source code into a character stream, and parsing the character stream into a lexical unit list, wherein the lexical unit list comprises a plurality of lexical units;

classifying the plurality of lexical units into a first-type lexical unit and a second-type lexical unit, wherein the first-type lexical unit is a lexical unit comprising an ambiguous token, the second-type lexical unit being a lexical unit not comprising the ambiguous token;

converting the first-type lexical unit into the second-type lexical unit; and

parsing the second-type lexical unit converted from the first-type lexical unit and the second-type lexical unit classified from the plurality of lexical units,

wherein parsing the character stream into the lexical unit list comprises:

parsing the character stream into the lexical unit list according to a preset word formation rule, wherein each lexical unit in the lexical unit list comprises: a token-name and an attribute-value, the token-name being the symbol of the lexical unit itself, and the attribute-value being the type of the lexical unit.

2 . The method as claimed in claim 1 , wherein classifying the plurality of lexical units into the first-type lexical unit and the second-type lexical unit comprises:

acquiring token-names of the plurality of lexical units;

determining an ambiguous target token-name from the token-names; and

determining the lexical unit to which the target token-name belongs as the first-type lexical unit, and determining the lexical unit to which the token-names except the target token-name belong as the second-type lexical unit.

3 . The method as claimed in claim 1 , wherein

converting the first-type lexical unit into the second-type lexical unit comprises: inputting the first-type lexical unit into a semantic analyzer for parsing to obtain the second-type lexical unit;

wherein parsing the second-type lexical unit converted from the first-type lexical unit and the second-type lexical unit classified from the plurality of lexical units comprises: inputting the second-type lexical unit converted from the first-type lexical unit and the second-type lexical unit classified from the plurality of lexical units into a syntactic analyzer for parsing; and inputting a parsing result of the second-type lexical unit by the syntactic analyzer to the semantic analyzer for parsing.

4 . The method as claimed in claim 3 , wherein inputting the first-type lexical unit into the semantic analyzer for parsing to obtain the second-type lexical unit comprises:

determining a type of the token-name of the first-type lexical unit according to context information of the first-type lexical unit; and

modifying an attribute-value of the first-type lexical unit according to the type of the token-name of the first-type lexical unit to obtain the second-type lexical unit.

5 . The method as claimed in claim 3 , wherein inputting the second-type lexical unit converted from the first-type lexical unit and the second-type lexical unit classified from the plurality of lexical units into the syntactic analyzer for parsing comprises:

assembling the second-type lexical unit converted from the first-type lexical unit and the second-type lexical unit classified from the plurality of lexical units into a syntax analysis tree.

6 . The method as claimed in claim 5 , wherein inputting the parsing result of the second-type lexical unit by the syntactic analyzer to the semantic analyzer for parsing comprises:

performing simplifying processing on the syntax analysis tree to construct an abstract syntax tree.

7 . A non-transitory computer-readable storage medium, the non-transitory computer-readable storage medium comprising a stored program, wherein when the program runs, a device where the non-transitory computer-readable storage medium is located is controlled to execute the method for parsing the programming language as claimed in claim 1 .

8 . A processor, the processor being configured to run a program stored in a memory, wherein when running, the program executes the method for parsing the programming language as claimed in claim 1 .

Assignments (1)

Priority Claims (1)

Continuity (1)

References Cited (21)