Method of creating the balanced parse tree having optimized height

1. A computer program stored in a non-transitory computer readable storage medium, which includes encoded commands, wherein when the computer program is executed by one or more processors of a computer system, the computer program allows the one or more processors to perform steps for generating a balanced parse tree having an optimized height, the steps comprising:

receiving a token stream including at least one token;

determining whether an n-ary parse tree is full, wherein the n-ary parse tree includes at least one node and the at least one node each includes n or less child nodes;

a first node generating operation of generating a node while increasing a height of the parse tree based on the token stream when the n-ary parse tree is full; and

a second node generating operation of generating the node while maintaining the height of the parse tree based on the token stream when the n-ary parse tree is not full;

wherein the first node generating operation includes generating a top-tree node included in the n-ary parse tree based on the token stream, and determining the top-tree node as a binary node.

2. The computer program stored in the non-transitory computer readable storage medium of claim 1 , wherein the determining of whether the n-ary parse tree is full includes

determining whether the number of nodes included in the n-ary parse tree is one, and

determining the n-ary parse tree to be full when the number of nodes included in the n-ary parse tree is one.

3. The computer program stored in the non-transitory computer readable storage medium of claim 1 , wherein the determining of whether the n-ary parse tree is full includes

determining whether each parent node included in the n-ary parse tree has n child nodes, and

determining the n-ary parse tree to be full when each parent node has n child nodes.

4. The computer program stored in the non-transitory computer readable storage medium of claim 1 , wherein the first node generating operation further includes generating a child node connected to the top-tree node based on the token stream when the top-tree node is generated.

5. The computer program stored in non-transitory computer readable storage medium of claim 1 , wherein the second node generating operation includes determining a top-tree node as a n-ary node and generating the child node connected to the top-tree node based on the token stream when the top-tree node is a binary node and each of the parent nodes has n child nodes wherein the top-tree node is excluded from the parent nodes.

6. The computer program stored in the non-transitory computer readable storage medium of claim 1 , wherein the second node generating operation includes determining a top-tree node as a n-ary node and generating the child node connected to the top-tree node based on the token stream when the top-tree node is a binary node and has two leaf nodes.

7. The computer program stored in the non-transitory computer readable storage medium of claim 1 , wherein the second node generating operation includes generating a child node connected to a last node when a top-tree node is a binary node and there is a parent node having less than n child nodes, and

the last node is a node having a largest depth among nodes including the less than n child nodes and having depths different from the depth of a lowest node.

8. The computer program stored in the non-transitory computer readable storage medium of claim 1 , wherein the second node generating operation includes generating the child node connected to a last node when a top-tree node is the n-ary node, and

the last node is a node having the largest depth among nodes including the less than n child nodes and having depths different from the depth of a lowest node.

9. A method of creating a balanced parse tree having an optimized height, which is performed by one or more processors of a computing device, the method comprising:

receiving a token stream including at least one token;

determining whether an n-ary parse tree is full, wherein the n-ary parse tree includes at least one node and the node includes n or less child nodes;

a first node generating operation of generating a node while increasing a height of the parse tree based on the token stream when the n-ary parse tree is full; and

a second node generating operation of generating the node while maintaining the height of the parse tree based on the token stream when the n-ary parse tree is not full;

wherein the first node generating operation includes venerating a top-tree node included in the n-ary parse tree based on the token stream, and determining the top-tree node as a binary node.

10. A computing device comprising:

one or more processors; and

a memory storing commands executable in the one or more processors,

wherein the one or more processors perform

receiving a token stream including at least one token,

determining whether an n-ary parse tree is full, wherein the n-ary parse tree includes at least one node and the node includes n or less child nodes,

a first node generating operation of generating a node while increasing a height of the parse tree based on the token stream when the n-ary parse tree is full, and

a second node generating operation of generating the node while increasing the height of the parse tree based on the token stream when the n-ary parse tree is not full;

wherein the first node generating operation includes generating a top-tree node included in the n-ary parse tree based on the token stream, and determining the top-tree node as a binary node.