Patents by Inventor Stephane Mery
Stephane Mery has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11036937Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: GrantFiled: November 8, 2019Date of Patent: June 15, 2021Assignee: International Business Machines CorporationInventors: Jean-Michel G. B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Publication number: 20200073927Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: ApplicationFiled: November 8, 2019Publication date: March 5, 2020Inventors: Jean-Michel G.B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Patent number: 10552534Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: GrantFiled: January 19, 2017Date of Patent: February 4, 2020Assignee: International Business Machines CorporationInventors: Jean-Michel G. B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Patent number: 10120654Abstract: A method for domain specific language design includes, with a physical computing system, receiving from a user, a number of annotations for at least one of a set of statements within a problem domain, the annotations identifying a set of elements within the statement. The method further includes forming a set of grammar rules for the problem domain based on the annotations, and parsing the set of statements using the set of grammar rules.Type: GrantFiled: March 26, 2012Date of Patent: November 6, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jean Michel Bernelas, Sylvain Dehors, Cyril Mathey, Stephane Mery
-
Patent number: 9733901Abstract: A computing system includes a processor; and a memory communicatively coupled to the processor. The processor is configured to: receive from a user, a number of annotations for at least one of a set of statements within a problem domain, the annotations identifying a set of elements within the statement; form a set of grammar rules for the problem domain based on the annotations; and parse the set of statements using the set of grammar rules.Type: GrantFiled: October 28, 2011Date of Patent: August 15, 2017Assignee: International Business Machines CorporationInventors: Jean Michel Bernelas, Sylvain Dehors, Cyril Mathey, Stephane Mery
-
Publication number: 20170132201Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: ApplicationFiled: January 19, 2017Publication date: May 11, 2017Inventors: Jean-Michel G.B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Patent number: 9582491Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: GrantFiled: April 13, 2016Date of Patent: February 28, 2017Assignee: International Business Machines CorporationInventors: Jean-Michel G. B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Patent number: 9471890Abstract: Embodiments relate to managing and executing interpreted language code. An aspect includes a parser configured to parse controlled language code against both a language grammar and for building an execution model comprising parsed known concepts. Another aspect includes a pattern matching engine configured to match patterns in the controlled language code with a patterns for a new concept. Yet another aspect includes a concept engine configured to create a new concept from the matched pattern and controlled language code and for saving the new concept into an object model and into a language grammar so that current and future parsing errors will not occur when recognizing the new concept.Type: GrantFiled: January 6, 2014Date of Patent: October 18, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jean Michel Bernelas, Steve Demuth, Stephane Mery
-
Publication number: 20160232153Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: ApplicationFiled: April 13, 2016Publication date: August 11, 2016Inventors: Jean-Michel G.B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Patent number: 9378195Abstract: Embodiments relate to validating logical statements in code for domain specific languages. An aspect includes parsing logical statements and annotating constraint type logical statements with specific constraint annotations from the logical grammar of the domain specific language. A non-contradiction graph is built using specific constraint annotations constrained to represent cases satisfying the logical statements and is solved to find a case that satisfies the logical statement or prove that no such case exists, thus locating a contradiction. The non-contradiction graph is negated to form a non-tautology graph constrained to represent cases violating the logical statements and the non-tautology graph is solved to find a case that violates the logical statement or prove that no such case exists, thus locating a tautology. A report is provided regarding at least one case satisfying the logical statement and at least one case violating the logical statement whereby the logical statement is validated.Type: GrantFiled: August 15, 2013Date of Patent: June 28, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jean Michel Bernelas, Ulrich Junker, Thierry Kormann, Stephane Mery
-
Patent number: 9367290Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: GrantFiled: April 15, 2015Date of Patent: June 14, 2016Assignee: International Business Machines CorporationInventors: Jean-Michel G. B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Patent number: 9361075Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: GrantFiled: November 12, 2014Date of Patent: June 7, 2016Assignee: International Business Machines CorporationInventors: Jean-Michel G. B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Publication number: 20160132300Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: ApplicationFiled: April 15, 2015Publication date: May 12, 2016Inventors: Jean-Michel G.B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Publication number: 20160132304Abstract: Aspects of the present invention disclose a method, computer program product, and system for parsing a domain-specific language (DSL) statement. The method includes one or more processors accessing a DSL statement that includes contracted phrases. The method further includes one or more processors identifying one or more contracted phrases in the DSL statement utilizing an annotated domain vocabulary for a DSL associated with the DSL statement and grammar rules for the DSL. The method further includes one or more processors determining expanded phrases corresponding to the identified one or more contracted phrases based on the annotated domain vocabulary and the grammar rules. The method further includes one or more processors creating an expanded abstract syntax tree (AST) that is representative of the DSL statement with the determined expanded phrases replacing the identified one or more contracted phrases.Type: ApplicationFiled: November 12, 2014Publication date: May 12, 2016Inventors: Jean-Michel G.B. Bernelas, Ulrich M. Junker, Stephane Mery
-
Patent number: 8930298Abstract: An object cache framework client selects a rule-set object in an object cache framework. The rule-set object comprises a rule-set (set of business rules). The object cache framework client evaluates criteria of the rule-set against properties of a plurality of rules engines. The object cache framework client determines if the properties of a rules engine, from a plurality of rules engines, satisfy the criteria of the rule-set. The object cache framework client supplies the rule-set object to the rules engine for execution of the rule-set.Type: GrantFiled: February 7, 2012Date of Patent: January 6, 2015Assignee: International Business Machines CorporationInventors: Steven J. Demuth, Edward M. Lynch, Stéphane Méry, Victor S. Moore
-
Publication number: 20140195306Abstract: Embodiments relate to managing and executing interpreted language code. An aspect includes a parser configured to parse controlled language code against both a language grammar and for building an execution model comprising parsed known concepts. Another aspect includes a pattern matching engine configured to match patterns in the controlled language code with a patterns for a new concept. Yet another aspect includes a concept engine configured to create a new concept from the matched pattern and controlled language code and for saving the new concept into an object model and into a language grammar so that current and future parsing errors will not occur when recognizing the new concept.Type: ApplicationFiled: January 6, 2014Publication date: July 10, 2014Applicant: International Business Machines CorporationInventors: Jean Michel Bernelas, Steve Demuth, Stephane Mery
-
Publication number: 20140059417Abstract: Embodiments relate to validating logical statements in code for domain specific languages. An aspect includes parsing logical statements and annotating constraint type logical statements with specific constraint annotations from the logical grammar of the domain specific language. A non-contradiction graph is built using specific constraint annotations constrained to represent cases satisfying the logical statements and is solved to find a case that satisfies the logical statement or prove that no such case exists, thus locating a contradiction. The non-contradiction graph is negated to form a non-tautology graph constrained to represent cases violating the logical statements and the non-tautology graph is solved to find a case that violates the logical statement or prove that no such case exists, thus locating a tautology. A report is provided regarding at least one case satisfying the logical statement and at least one case violating the logical statement whereby the logical statement is validated.Type: ApplicationFiled: August 15, 2013Publication date: February 27, 2014Applicant: International Business Machines CorporationInventors: Jean Michel Bernelas, Ulrich Junker, Thierry Kormann, Stephane Mery
-
Publication number: 20130132326Abstract: An object cache framework client selects a rule-set object in an object cache framework. The rule-set object comprises a rule-set (set of business rules). The object cache framework client evaluates criteria of the rule-set against properties of a plurality of rules engines. The object cache framework client determines if the properties of a rules engine, from a plurality of rules engines, satisfy the criteria of the rule-set. The object cache framework client supplies the rule-set object to the rules engine for execution of the rule-set.Type: ApplicationFiled: February 7, 2012Publication date: May 23, 2013Applicant: International Business Machines CorporationInventors: Steven J. Demuth, Edward M. Lynch, Stéphane Méry, Victor S. Moore
-
Publication number: 20130031526Abstract: A computing system includes a processor; and a memory communicatively coupled to the processor. The processor is configured to: receive from a user, a number of annotations for at least one of a set of statements within a problem domain, the annotations identifying a set of elements within the statement; form a set of grammar rules for the problem domain based on the annotations; and parse the set of statements using the set of grammar rules.Type: ApplicationFiled: October 28, 2011Publication date: January 31, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jean Michel Bernelas, Sylvain Dehors, Cyril Mathey, Stephane Mery
-
Publication number: 20130031529Abstract: A method for domain specific language design includes, with a physical computing system, receiving from a user, a number of annotations for at least one of a set of statements within a problem domain, the annotations identifying a set of elements within the statement. The method further includes forming a set of grammar rules for the problem domain based on the annotations, and parsing the set of statements using the set of grammar rules.Type: ApplicationFiled: March 26, 2012Publication date: January 31, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jean Michel Bernelas, Sylvain Dehors, Cyril Mathey, Stephane Mery