Now showing items 1-2 of 2

• #### Automatic evaluation of top-down predictive parsing ﻿

(2016-04-01)
External research report
Open Access
We develop efficient methods to check whether two given Context-Free Grammars (CFGs) are transformed into parsers that recognize the same language and construct the same Abstract Syntax Trees (ASTs) for each input. In this ...
• #### The HOM problem is decidable ﻿

(2009-06)
External research report
Open Access
We close affirmatively a question which has been open for 35 years: decidability of the HOM problem. The HOM problem consists in deciding, given a tree homomorphism $H$ and a regular tree languagle $L$ represented by a ...