12
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Necessary and sufficient conditions for a power language to be deterministic

Pages 133-142 | Published online: 21 Dec 2010

References

  • Bordier , J. and Saya , H. 1973 . A necessary and sufficient condition for a power language to be LL(k) . The Computer Journal , 16 ( 4 ) : 351 – 356 .
  • Čuli[kacute] , K. II and Cohen , R. 1973 . LR-Regular Grammars—an extension of LR(k) grammars . J.Computer and System Sciences , 7 ( 1 ) : 66 – 95 .
  • Ginsburg , S. and Greibach , S. 1966 . Deterministic context-free languages . Information and Control , 17 : 620 – 648 .
  • Hopcroft , J. E. and Ullman , J. D. 1969 . Formal Languages and their relations to Automata , Reading, Mass : Addison-Wesley .
  • Wood , D. 1970 . The theory of left factored languages, Part 2 . The Computer Journal , 13 : 55 – 62 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.