Skip to main content
babou's user avatar
babou's user avatar
babou's user avatar
babou
  • Member for 11 years, 1 month
  • Last seen more than a month ago
14 votes

What does research in theoretical computer science involve?

10 votes
Accepted

Natural examples of context-sensitive languages from practice

10 votes

Deciding whether a context-free language is regular

8 votes

Is it possible to optimize the calculation of $ax+b$ once I know $a$ and $b$?

7 votes
Accepted

Example of context-free grammar that triggers exponential behaviour without memoization in RD parsers

7 votes

Recovering a parse forest from an Earley parser?

4 votes
Accepted

How can an inherited attribute be simulated using a synthesized attribute?

4 votes

Chomsky normal form method: CYK parser performance implications?

4 votes

Flat vs non-flat domains

4 votes

Closure properties of deterministic context-sensitive languages

3 votes
Accepted

Complexity of a GLR parser on an ambiguous grammar

3 votes

Is it possible to create an algorithm-aware optimizer?

2 votes
Accepted

Define the properties of a grammar that is the fastest to parse

2 votes

Complexity of ambiguous parsing?

2 votes
Accepted

Meaning of program as solution of a recursive equation

2 votes

Context-free Grammar for a Context-free Language Intersecting a Regular Language (get the Maximum Number of Rules)

2 votes
Accepted

Name a set of program variables

1 vote

What requirements should a denotational semantics for a programming language satisfy to be correct?

1 vote

Chomsky hierarchy for tree structures

1 vote

Tool for specifying operational semantics for given formally specified programming language

1 vote

is "spaghetti sort" really O(n) (even as a thought experiment) ?

0 votes

A simple programming language?

0 votes

Research and open challenges in Programming Language Theory

0 votes

Which factors make the problem of inferring the grammar difficult?