Filters

18 Hits in 2.2 sec

### Construction of efficient generalized LR parsers [chapter]

Miguel A. Alonso, David Cabrero, Manuel Vilares
1998 Lecture Notes in Computer Science
The result is a Generalized LR parsing algorithm working at complexity O(n 3 ) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the  ...  We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm.  ...  From Earley to LR in dynamic programming In this section we show how a dynamic programming version of LR and LALR parsing algorithms can be derived from Earley's algorithm.  ...

### Page 4926 of Mathematical Reviews Vol. , Issue 99g [page]

1999 Mathematical Reviews
Alonso Pardo, An LALR extension for DCGs in dynamic programming (267-278).  ...  Thakur, Integer programming as a framework for optimization and approximability (144-161); Samuel R.  ...

### Dynamic programming as frame for efficient parsing

M.V. Ferro, D.C. Souto, M.A.A. Pardo
Proceedings SCCC'98. 18th International Conference of the Chilean Society of Computer Science (Cat. No.98EX212)
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology.  ...  We justify the consideration of dynamic programming, both in definite clause and context-free grammar parsing, highlighting the parallelism between the conclusions reached in both cases.  ...  Tests using dynamic programming, both for the parsing of the sole context-free backbone and whole DCG, are shown in Fig. 6 and Fig. 7 respectively.  ...

### 6 — Program transformations [chapter]

1981 Lecture Notes in Computer Science
Create an arrow from y to x. The input is accepted if there is at least one node labelled X final in U n .  ...  If there is a node labelled Y in U j • then let y be that node, • else create a node y labelled Y . Add y to U j . 4. If there is no arrow from y to x, then add such an arrow.  ...  of Programs").  ...

### A New Method for Dependent Parsing [chapter]

Trevor Jim, Yitzhak Mandelbaum
2011 Lecture Notes in Computer Science
Dependent grammars can cleanly specify common features that cannot be handled by context-free grammars, such as length fields in data formats and significant indentation in programming languages.  ...  To address this shortcoming, we have developed a new method for implementing dependent parsers by extending existing parsing algorithms.  ...  However, we add here a brief comparison with definite clause grammars (DCGs) [15] , a popular formalism for specifying grammars as logic programs.  ...

### Page 1645 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews
An LALR extension for DCGs in dynamic programming.  ...  ., (99h:68008) Cardell-Oliver, Rachel An equivalence theorem for the operational and temporal semantics of real-time, concurrent programs.  ...

### Survey on Instruction Selection: An Extensive and Modern Literature Review [article]

Gabriel S. Hjort Blindell
2013 arXiv   pre-print
This report addresses that need by performing an extensive review and categorisation of existing research.  ...  The instruction selector is responsible of transforming an input program from its target-independent representation into a target-specific form by making best use of the available machine instructions.  ...  For brevity we will henceforth abbreviate dynamic programming as DP.  ...

### Page 1839 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews
An LALR extension for DCGs in dynamic programming. (English summary) Math ical and c ional analysis of natural language (Tarragona, 1996), 267-278, Stud. Funct. Struct.  ...  Transverse decay of solutions in an elastic cylinder. (English and Italian summaries) Meccanica 33 (1998), no. 6, 577-585.  ...

### Parsing of configuration files

René Schwaiger, Franz Puntigam, Markus Raab
2019
For Elektra to work without, or with only minor modifications to an application it needs to understand the configuration file format of said application.  ...  In ever growing complex computer systems, the large amount of different settings for different software can easily lead to misconfiguration.  ...  Acknowledgements I would like to thank my family for their great support, especially my brother, who always encouraged me, even when this thesis did not progress in the way it should.  ...

### An efficient all-paths parsing algorithm for natural languages

Masaru Tomita
2018
Acknowledgements f l would like to thank Jaime Carbonell, Herb Simon, Phil Hayes, Ralph Grishman, Takehiro Tokuda and Osamu Watanabe for thoughtful comments on an earlier version of this paper and Cynthia  ...  Hibbard for helping to produce this document.  ...  MLR, however, can handle multiply-defined entries, using a dynamic programming method.  ...

### OASIcs, Volume 51, SLATE'16, Complete Volume [article]

Marjan Mernik, José Paulo Leal, Hugo Gonçalo Oliveira
2016
The authors would like to thank the reviewers for their comments, insights and corrections.  ...  In that case, will try to use refinements and extensions of the given DCG formalism to define a suitable external DSL.  ...  This DCG can be used for verifying that a rule is in the language. The grammar formalism can help to clarify the syntax for people who are not experts in logic programming or Prolog.  ...

### Parsing for agile modeling

Jan Kurs
2016
Context-sensitive Grammars Definite Clause Grammars (DCGs) [PW86] offer a way of expressing grammars in a logic programming language such as Prolog.  ...  LL(*) grammars are an extension of LL(k) grammars with unlimited lookahead, reaching the expressiveness of PEGs, in some cases beyond GLR and PEGs [PF11].  ...  We present a computation for both versions, dynamic and static: Definition 5.7 (Dynamic NEXT).  ...

### Parsing for agile modeling

Jan Kurs, Oscar Marius Nierstrasz
2016 unpublished
Context-sensitive Grammars Definite Clause Grammars (DCGs) [PW86] offer a way of expressing grammars in a logic programming language such as Prolog.  ...  LL(*) grammars are an extension of LL(k) grammars with unlimited lookahead, reaching the expressiveness of PEGs, in some cases beyond GLR and PEGs [PF11].  ...  We present a computation for both versions, dynamic and static: Definition 5.7 (Dynamic NEXT).  ...

### Exploring software systems

L. Moonen
International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings.
"guinea pigs" for the development and validationn of the techniques and tools described in this thesis.  ...  Acknowledgments s Wee would like to thank Serge Barthel of Epictoid for providing us with the source code andd feature requests used in the CHARTOON case study.  ...  to combine extraction for aa language with extraction for an embedded extension.  ...

### On Language Processors and Software Maintenance

Wolfgang Lohmann
2008
Furthermore, AOP for Prolog is introduced to improve maintainability of language specifications and derived tools.  ...  software written in the evolving language.  ...  Next, we introduced seven research questions that were the guideline for the research topics in the core of the thesis.  ...
« Previous Showing results 1 — 15 out of 18 results