parsable

Multiple independent updates to make it parsable in Perl 5 have been published.

This includes uttering parsable text, and ensuring that all referring expressions can be resolved.

Its speeches have a rhetoric of their own; it's parsable, though its original grammar has to be inferred.

The parse tree is also more suitable for supporting automated code refactoring, as it remains in a parsable text form at all times.

Mildly context-sensitive grammars are conjectured to be powerful enough to model natural languages while remaining efficiently parsable in the general case.

The class of grammars which are parsable in this way is known as the LL grammars.

Parsable output, including XML log output.

Another approach is to create a syntactically-correct, easily parsable sentence using nonsense words; a famous such example is "The gostak distims the doshes".

We should not regard their 'invention' of a structured gestural language as grounds for believing that earlier hominid handwaving could thus rapidly have attained parsable results.

However, this language is parsable by a general CFG parser like the CYK algorithm.

Combinatory categorial grammar (CCG) is an efficiently parsable, yet linguistically expressive grammar formalism.

The six semantic rules provide enough data structure and metadata to for TMA users to design understandable and parsable TMA documents.

The finals are about to take place in New York, with the first prize being $1 million, and this is where Mr. Rapp makes his most questionable, if thematically parsable, leap into hyperbole.

It is almost always present in normal speech, in all natural languages but not in some constructed languages, such as Loglan or Lojban, which are designed so that all words are parsable.

XML is described as being generally parsable like a two-level grammar for non-validated XML and a Conway-style pipeline of coroutines (lexer, parser, validator) for valid XML.

Of course it is possible that the parsable president sees political advantage in allowing Congress and the public to push him into a ground conflict of uncertain cost and consequence (Who knows the true meaning of "has no intention"?)

A non-validating parser may, however, elect not to read parsable external entities (including the external subset), and does not have to honor the content model restrictions defined in element declarations and in attribute list declarations.

A central goal in LFG research is to create a model of grammar with a depth which appeals to linguists while at the same time being efficiently parsable and having the rigidity of formalism which computational linguists require.

Non-validating parsers may eventually attempt to locate these external entities in the non-standalone mode (by partially interpreting the DTD only to resolve their declared parsable entities), but will not validate the content model of these documents.

However, such documents will still be fully parsable in the non-standalone mode of validating parsers, which will signal an error if these external entities cannot be located with their specified public identifier (FPI) and/or system identifier (a URI), or are inaccessible.

If the XML document depends on parsable external entities (including the specified external subset, or parsable external entities declared in the internal subset), it should assert in its XML declaration.