Succinctness of Descriptions of Unambiguous Context-Free Languages

Schmidt, Erik Meineche

Succinctness of Descriptions of Unambiguous Context-Free Languages

File(s)

76-277.ps (272.75 KB)

76-277.pdf (747.77 KB)

Permanent Link(s)

https://hdl.handle.net/1813/7319

Collections

Computer Science Technical Reports

Author

Schmidt, Erik Meineche

Abstract

There is no recursive function bounding the succintness gained using ambiguous grammars over unambiguous ones in the description of unambiguous context-free languages.

Date Issued

1976-04

Publisher

Cornell University

Keywords

computer science

•

technical report

Previously Published as

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-277

Type

technical report