SNOMED International APG Parsers
This site provides an example parser for each of the SNOMED CT computable language syntaxes, including Compositional Grammar and the Expression Constraint Language (brief and full syntaxes).
Each SNOMED International parser takes an input string and analyses it according to the rules defined in the associated ABNF syntax to determine whether or not the string is valid. If the string is valid based on the rules, then a Parser State of 'MATCH' is returned. If the string is not valid, then a Parser State of 'NOMATCH' is returned.
Please note that these parsers were created using the APG parser generator (http://www.coasttocoastresearch.com/). A copy of these parsers, and additional supporting materials can be found on the IHTSDO's SNOMED CT Languages Github repository (https://github.com/IHTSDO/SNOMEDCT-Languages).
SNOMED CT Compositional Grammar
This parser validates an input string according to the ABNF syntax defined for SNOMED CT compositional grammar v2.3.1 (http://snomed.org/scg).
SNOMED CT Expression Constraint Language - Brief Syntax
This parser validates the input string according to the ABNF brief syntax defined for the SNOMED CT expression constraint language v1.3 (http://snomed.org/ecl). The brief syntax is the normative syntax for expression constraints, and is recommended for use in interoperable communications between systems.
SNOMED CT Expression Constraint Language - Long Syntax
This parser validates the input string according to the ABNF long syntax defined for the SNOMED CT expression constraint language v1.3 (http://snomed.org/ecl). The long syntax is provided for information only, and may be used where an English-based textual representation of the language is required.
SNOMED CT Expression Template Language
This parser validates the input string according to the ABNF syntax defined for the SNOMED CT expression template language v1.0 (http://snomed.org/etl).
This site uses code from APG - an ABNF Parser Generator - https://github.com/ldthomas/apg-js