Cargando...
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
A distance between two languages is a useful tool to measure the language similarity, and is closely related to the intersection problem as well as the shortest string problem. A parsing expression grammar (PEG) is an unambiguous grammar such that the choice operator selects the first matching in PE...
Guardado en:
| Publicado en: | Developments in Language Theory |
|---|---|
| Autores principales: | , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7247870/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48516-0_4 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|