A parsor generator for LL(1) grammars.

Date

1975

Author

Yalcin, Zehra Meral

Metadata

Show full item record

Item Usage Stats

72
views

0
downloads

URI

https://hdl.handle.net/11511/7491

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A set-based execution model for parallel prolog Aybay, Işık; Baray, Mehmet; Bilgen, Semih; Department of Electrical and Electronics Engineering (1989)
A dataflow graph execution model for prolog Başbuğoğlu, Osman; Aybay, Işık; Halıcı, Uğur; Department of Electrical and Electronics Engineering (1989)
A Counting-Based Heuristic for ILP-Based Concept Discovery Systems Mutlu, Alev; Karagöz, Pınar; Kavurucu, Yusuf (2013-09-13) Concept discovery systems are concerned with learning definitions of a specific relation in terms of other relations provided as background knowledge. Although such systems have a history of more than 20 years and successful applications in various domains, they are still vulnerable to scalability and efficiency issues - mainly due to large search spaces they build. In this study we propose a heuristic to select a target instance that will lead to smaller search space without sacrificing the accuracy. The p...
A metamodel for the high level architecture object model Çetinkaya, Deniz; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2005) The High Level Architecture (HLA), IEEE Std. 1516-2000, provides a general framework for distributed modeling and simulation applications, called federations. HLA focuses on interconnection of interacting simulations, called federates, with special emphasis on reusability and interoperability. An HLA object model, be it a simulation object model (SOM), a federation object model (FOM) or the management object model (MOM), describes the data exchanged during federation execution. This thesis introduces a meta...
A code generator for transputer assembler. Şener, Ilkay; Kiper, Ayşe; Department of Computer Engineering (1993)

Citation Formats

Z. M. Yalcin, “A parsor generator for LL(1) grammars.,” Middle East Technical University, 1975.