An efficient context-free parsing algorithm
Communications of the ACM
Mathematical Linguistics
| Hi-index | 0.00 |
The problems of machine execution of an open language are addressed. Some problems of the software support of the basic property of open languages, i.e., their changeability at each level of their presentation: lexical, syntactical, and semantic, are discussed. A mathematical definition of an open language has been produced as a potentially infinite-oriented graph, the apices of which are languages (in classical theoretical-multiple presentation), and the ribs between the apices are reflections of languages that are compatible with reflections of their alphabets (the definition of a compatible reflection is also formulated in this work).