Detection of data in a sequence of characters
First Claim
Patent Images
1. A method to process a sequence of characters representing natural or computer language, the method comprising:
- receiving, by a lexer executing on a processor, the sequence of characters in a communication between users or in output from one of a compiler and an interpreter;
converting, by a lexer, the sequence of characters into a sequence of tokens, at least one token comprising a proto-lexeme and a proto-token type, the proto-token type representing multiple token types, each of the multiple token types describing one of a plurality of predetermined classes ascribed to the proto-lexeme within the sequence of characters during the conversion,wherein a parser, executing on the processor, resolves the proto-lexeme into a single lexeme having a single class that is one of the multiple classes represented by the proto-token type, and further resolves the proto-token type into a single token type describing the single class; and
when the single class is associated with a user application, presenting, by the processor, an option to update the user application with the single lexeme, wherein the user application includes one of a calendar and an address book.
0 Assignments
0 Petitions
Accused Products
Abstract
A method of processing a sequence of characters, the method comprising converting the sequence of characters into a sequence of tokens so that each token comprises a lexeme and one of a plurality of token types. Each of the plurality of token types relates to at least one of a plurality of predetermined functions, wherein at least one said token type relates to multiple functions of the plurality of predetermined functions.
-
Citations
22 Claims
-
1. A method to process a sequence of characters representing natural or computer language, the method comprising:
-
receiving, by a lexer executing on a processor, the sequence of characters in a communication between users or in output from one of a compiler and an interpreter; converting, by a lexer, the sequence of characters into a sequence of tokens, at least one token comprising a proto-lexeme and a proto-token type, the proto-token type representing multiple token types, each of the multiple token types describing one of a plurality of predetermined classes ascribed to the proto-lexeme within the sequence of characters during the conversion, wherein a parser, executing on the processor, resolves the proto-lexeme into a single lexeme having a single class that is one of the multiple classes represented by the proto-token type, and further resolves the proto-token type into a single token type describing the single class; and when the single class is associated with a user application, presenting, by the processor, an option to update the user application with the single lexeme, wherein the user application includes one of a calendar and an address book. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method of processing data in a sequence of characters representing natural or computer language, comprising:
-
receiving, by a parser executing on a processor, a sequence of tokens, at least one token comprising a proto-lexeme and a proto-token type, the proto-token type representing multiple token types, each of the multiple token types describing one of a plurality of predetermined classes previously ascribed to the proto-lexeme within the sequence of characters received by a lexer in a communication between users or in output from one of a compiler and an interpreter; parsing, by the parser, the sequence of tokens to detect predetermined types of data; resolving, by the parser, the proto-lexeme into a single lexeme having a single class that is one of the multiple classes represented by the proto-token type, and further resolving the proto-token type into a single token type describing the single class; and when the single class is associated with a user application, presenting, by the processor, an option to update the user application with the single lexeme, wherein the user application includes one of a calendar and an address book. - View Dependent Claims (9)
-
-
10. A method of processing a sequence of characters representing natural or computer language, the method comprising:
-
receiving, by a lexer executing on a processor, the sequence of characters in a communication between users or in output from one of a compiler and an interpreter; converting, by the lexer, the sequence of characters into a sequence of tokens comprising one or more proto-lexemes and one or more corresponding proto-token types, wherein each proto-lexeme is defined as belonging to one of; a first set comprising one class, wherein the proto-token type represents the one class, and a second set comprising a combination of classes, wherein the proto-token type represents the classes in the combination; resolving, by a parser executing on the processor, each proto-lexeme into a single lexeme and the corresponding proto-token type into a single token type; when the single class is associated with a user application, presenting, by the processor, an option to update the user application with the single lexeme, wherein the user application includes one of a calendar and an address book. - View Dependent Claims (11, 12, 13)
-
-
14. An apparatus to detect predetermined data in a sequence of characters representing natural or computer language, the apparatus comprising:
-
a processor; a network interface coupled to the processor to receive the sequence of characters in a communication between users or in output from one of a compiler and an interpreter; a lexer executing on the processor to convert the sequence of characters into a sequence of tokens, at least one token comprising a proto-lexeme and a proto-token type that represents multiple token types, each of the multiple token types describing one of a plurality of predetermined classes ascribed to the proto-lexeme within the sequence of characters during the conversion, wherein a parser, executing the processor, resolves the proto-lexeme into a single lexeme having a single class that is one of the multiple classes represented by the proto-token type, and further resolves the proto-token type into a single token type describing the single class; and when the single class is associated with a user application, presenting, by the processor, an option to update the user application with the single lexeme, wherein the user application includes one of a calendar and an address book. - View Dependent Claims (15, 16, 17, 18, 19)
-
-
20. A data processing system for processing a sequence of characters representing natural or computer language comprising:
-
means for receiving the sequence of characters in a communication between users or in output from one of a compiler and an interpreter, means for converting the sequence of characters into a sequence of one or more proto-lexemes and one or more proto-token types, wherein each proto-lexeme is defined as belonging to one of; a first set comprising one class, wherein the corresponding proto-token type represents the one class, and a second set comprising a combination of classes, wherein the corresponding proto-token type represents the classes in the combination; means for parsing the sequence of one or more proto-lexemes by providing a single analysis path in a decision tree for each said proto-lexeme to resolve each proto-lexeme into a single lexeme and the corresponding proto-token type into a single token type; and means for presenting an option to update the user application with the single lexeme when the single class is associated with a user application, wherein the user application includes one of a calendar and an address book.
-
-
21. A non-transitory machine-readable storage medium storing executable program instructions, which, when executed, cause a data processing system to process a sequence of characters representing natural or computer language by:
-
receiving, by a lexer executing on a processor, the sequence of character in a communication between users or in output from one of a compiler and an interpreter; and converting by the lexer, the sequence of characters into a sequence of tokens, at least one token comprising a proto-lexeme and a proto-token type, the proto-token type representing multiple token types, each of the multiple token types describing one of a plurality of predetermined classes ascribed to the proto-lexeme within the sequence of characters during the conversion, wherein a parser, executing on the processor, resolves the proto-lexeme into a single lexeme having a single class that is one of the multiple classes represented by the proto-token type, and further resolves the proto-token type into a single token type describing the single class; and when the single class is associated with a user application, presenting, by the processor, an option to update the user application with the single lexeme, wherein the user application includes one of a calendar and an address book.
-
-
22. A non-transitorymachine-readable storage medium storing executable program instructions, which, when executed cause a data processing system to detect data in a sequence of characters representing natural or computer language by:
-
converting, by a lexer executing on a processor, the sequence of characters into a sequence of one or more proto-lexemes and one or more proto-token types, the sequence of characters previously received by the lexer in a communication between users or in output from one of a compiler and an interpreter, wherein each proto-lexeme is defined as being associated with one of; a first set comprising a single class, wherein the corresponding proto-token type represents the single class, and a second set comprising a combination of classes, wherein the corresponding proto-token type represents the classes in the combination; resolving, by a parser executing on the processor, the sequence of one or more proto-lexemes into a sequence of single lexemes and the corresponding one or more proto-token types into single token types, said resolving comprising providing a single analysis path for each said proto-lexeme; and when the single class is associated with a user application, presenting, by the processor, an option to update the user application with the single lexeme, wherein the user application includes one of a calendar and an address book.
-
Specification