A lattice framework for analyzing context-free languages with applications in parser simplification and data-flow analysis
| dc.citation.epage | 306 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 287 | en_US |
| dc.citation.volume | 15 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | Yang, W | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:46:53Z | |
| dc.date.available | 2014-12-08T15:46:53Z | |
| dc.date.issued | 1999-03-01 | en_US |
| dc.description.abstract | We propose a lattice framework for analyzing context-free grammars and context-free languages. This framework is motivated by a technique for simplifying parsers with information derived from the associated scanners. We define the lattice framework and demonstrate it using additional applications, including data-flow analysis. Soundness and other properties of the lattice framework are also discussed. | en_US |
| dc.identifier.issn | 1016-2364 | en_US |
| dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/31507 | |
| dc.identifier.wosnumber | WOS:000079483200006 | |
| dc.language.iso | en_US | en_US |
| dc.subject | compiler | en_US |
| dc.subject | context-free grammar | en_US |
| dc.subject | finite-state machine | en_US |
| dc.subject | lattice | en_US |
| dc.subject | Mealy machine | en_US |
| dc.subject | parser | en_US |
| dc.subject | regular expression | en_US |
| dc.subject | scanner | en_US |
| dc.title | A lattice framework for analyzing context-free languages with applications in parser simplification and data-flow analysis | en_US |
| dc.type | Article | en_US |