Method of creating the balanced parse tree having optimized height
US10416971B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 25, 2017 |
| Grant date | Sep 17, 2019 |
| Priority date | — |
| Expiry date | Nov 24, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/427
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Provided is a computer program stored in a 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 processor to perform the following steps for generating a balanced parse tree having an optimized height, the steps including: receiving a token stream including at least one token—the token stream meets an associate law—; determining whether an n-ary parse tree is full—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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.