According to the ECMAScript spec: There are several situations where the identification of lexical input elements is sensitive to the syntactic grammar context that is consuming the input elements...

In Chomsky's hierarchy, the set of recursive languages is not defined. I know that recursive languages are a subset of recursively enumerable languages and that all recursive languages are decidabl...

I often hear claims that C++ is a context-sensitive language. Take the following example: a b(c); Is this a variable definition or a function declaration? That depends on the meaning of the symb...

i am reading the Definitive ANTLR reference by Terence Parr, where he says: Semantic predicates are a powerful means of recognizing context-sensitive language structures by allowing runtime i...

Related questions/material: How can we match a^n b^n with Java regex? How to determine if a number is a prime with regex? (which deals with unary prime matching, while I'm looking for base ≥ 2; a...

CSG is similar to CFG but the reduce symbol is multiple. So, can I just use CFG parser to parse CSG with reducing production to multiple terminals or non-terminals? Like 1. S → a bc 2. S → a S B...

I'm trying to find a plain (i.e. non-formal) explanation of the 4 levels of formal grammars (unrestricted, context-sensitive, context-free, regular) as set out by Chomsky. It's been an age since I...

According to this answer => in Scala is a keyword which has two different meanings: 1 to denote a function type: Double => Double and 2 to create a lambda expression: (x: Double): Double =&gt...

I've been recently writing parser for language based on C. I'm using CUP (Yacc for Java). I want to implement "The lexer hack" (http://eli.thegreenplace.net/2011/05/02/the-context-sensitivity-of-c...

I just took my midterm but couldn't answer this question. Can someone please give a couple of examples of the language and construct a grammar for the language or at least show me how i wi...

I'm trying to understand context-sensitive grammars, and I understand why languages like {ww | w is a string} {an bn cn | a,b,c are symbols} are not context free, but what I'd like ...

Can someone explain to me why grammars [context-free grammar and context-sensitive grammar] of this kind accepts a String? What I know is Context-free grammar is a formal grammar in which every ...