Sciweavers

3440 search results - page 18 / 688
» Logics For Context-Free Languages
Sort
View
VL
2002
IEEE
111views Visual Languages» more  VL 2002»
15 years 11 months ago
An Interrogative Approach to Novice Programming
Domain specific programming languages tend to be rigid in capability and dependent on either a graphical interface or a scripting language. We present a question-oriented approach...
Alexander Quinn
IPL
2008
99views more  IPL 2008»
15 years 6 months ago
A CKY parser for picture grammars
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Stefano Crespi-Reghizzi, Matteo Pradella
TCS
2008
15 years 5 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
CL
2000
Springer
15 years 5 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
NECO
2002
106views more  NECO 2002»
15 years 5 months ago
Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM
In response to Rodriguez' recent article (2001) we compare the performance of simple recurrent nets and "Long Short-Term Memory" (LSTM) recurrent nets on context-fr...
Jürgen Schmidhuber, Felix A. Gers, Douglas Ec...