An efficient algorithm for ${\mathrm{\LaTeX}}$ documents comparing
The problem is constructing the differences that arise on ${\mathrm{\LaTeX}}$ documents editing. Each document is represented as a parse tree whose nodes are called tokens. The smallest possible text representation of the document that does not change the syntax tree is constructed. All of the text...
Main Author: | |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Institute of Computer Science
2015-04-01
|
Series: | Компьютерные исследования и моделирование |
Subjects: | |
Online Access: | http://crm.ics.org.ru/uploads/crmissues/crm_2015_2/15712.pdf |