Constraint language parser which rejects invalid filter constraint during run time
US6397383B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 26, 1999 |
| Grant date | May 28, 2002 |
| Priority date | — |
| Expiry date | Feb 26, 2019 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99936
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present invention provides a system and method for parsing a constraint language in a computer network. The method includes receiving a constraint string; parsing the constraint string, comprising replacement of valid operators, variables, and values with special characters; and determining if the parsed constraint string indicates the existence of errors in the constraint string. The parser of the present invention is based upon an analysis of the constraint language from which patterns of the language are identified. The easily implemented parser of the present invention is developed based on these patterns. Because the method of the present invention replaces members of a finite set of valid operators, variables, and values, instead of attempting to identify an infinite number of possible errors, it is able to detect all invalid constraints.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.