Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Context-Free Language"”.
-
Some aspects of error correction of programming languages
… treats the problem of error correction in a context free language, and the design of an error correcting parser for the BASIC language. Two important things can be said about this thesis. First, it presents the problem of error correction in a context free language, and the existing results …
-
Improving the Efficiency of Graph-Based Static Analysis
… of three popular static analysis frameworks: context-free language reachability, recursive state machine reachability and set constraint analysis. In this dissertation, the methodologies focus more on eliminating redundancy rather than theoretically lowering complexity. For transitive …
-
Complexity of Dyck-reachability in directed graphs
… edge labels of the path is a member of the Dyck language, i.e., the language of balanced parentheses. We present previous works on upper bounds in Dyck-reachability in graphs and the equivalent formulation of the problem in the context of Recursive State Machines. We also present known lower …
-
SCAN: ΜΙΑ ΓΛΩΣΣΑ ΓΙΑ ΑΚΟΛΟΥΘΙΑΚΗ ΠΡΟΣΠΕΛΑΣΗ ΔΙΔΙΑΣΤΑΤΩΝ ΔΕΔΟΜΕΝΩΝ
… AND THE DEVELOPMENT OF A NEW, SPECIAL PURPOSE LANGUAGE, CALLED SCAN LANGUAGE. THE DEVELOPMENT OF SCAN PROVIDES AN EFFICIENT APPROACH TO THE FOLLOWING PROBLEM: "GIVEN AN IMAGE ARRAY P OFNXN ELEMENTS, DEVELOP A TOOL WHICH CAN DESCRIBE AND PRODUCE ALL POSSIBLE SCANNING SEQUENCES OF P (THAT IS …
-
A Lightweight Framework for Universal Fragment Composition
Domain-specific languages (DSLs) are useful tools for coping with complexity in software development. DSLs provide developers with appropriate constructs for specifying and solving the problems they are faced with. While the exact definition of DSLs can vary, they can roughly be divided into two …