Fdtxjr

Different meanings of こわい

Is this draw by repetition?

Why didn't Boeing produce its own regional jet?

Why is the sentence "Das ist eine Nase" correct?

meaning of 腰を落としている

OP Amp not amplifying audio signal

Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?

What is the opposite of "eschatology"?

What do you call someone who asks many questions?

How exploitable/balanced is this homebrew spell: Spell Permanency?

Is there an online compendium of Rav Moshe teshuvos in English that exists?

What is the most common color to indicate the input-field is disabled?

Is there an expression that means doing something right before you will need it rather than doing it in case you might need it?

Can a virus destroy the BIOS of a modern computer?

Where would I need my direct neural interface to be implanted?

What are the G forces leaving Earth orbit?

ssTTsSTtRrriinInnnnNNNIiinngg

How can a day be of 24 hours?

Could the museum Saturn V's be refitted for one more flight?

Is it "common practice in Fourier transform spectroscopy to multiply the measured interferogram by an apodizing function"? If so, why?

Is it inappropriate for a student to attend their mentor's dissertation defense?

How to prevent "they're falling in love" trope

What's the meaning of "Sollensaussagen"?

What Exploit Are These User Agents Trying to Use?

Is there anything in the literature about $2k$-nary infix grammars, in particular easy validity and parsing schemes?

$L=langle G_1,G_2 rangle in R$?

0

$begingroup$

Suppose $k$ is a positive integer: I'm working with the $2k$-nary infix grammar
$$
S to mathrmopd | SSldots S mathrmopr SSldots S,
$$
where there are $k$ $S$s in each side of the $mathrmopr$.

This is a CFG, so the rich theory of CFG's and PDA's applies, and it's also obvious that the grammar is ambiguous as is (without parentheses or precedence rules). But far more simplistically --

I have found a very easy algorithm involving just counting how many $mathrmopd$s are in between pairs of $mathrmopr$s to validate expressions in the language and which provides a parse for valid expressions.

Is this result new and/or interesting?

context-free-grammar

share|cite|improve this question

edited Mar 20 at 20:02

Daniele Tampieri

2,65221022

asked Mar 20 at 18:20

Steven MinskerSteven Minsker

11

$endgroup$

add a comment | 

0

$begingroup$

Suppose $k$ is a positive integer: I'm working with the $2k$-nary infix grammar
$$
S to mathrmopd | SSldots S mathrmopr SSldots S,
$$
where there are $k$ $S$s in each side of the $mathrmopr$.

This is a CFG, so the rich theory of CFG's and PDA's applies, and it's also obvious that the grammar is ambiguous as is (without parentheses or precedence rules). But far more simplistically --

I have found a very easy algorithm involving just counting how many $mathrmopd$s are in between pairs of $mathrmopr$s to validate expressions in the language and which provides a parse for valid expressions.

Is this result new and/or interesting?

context-free-grammar

share|cite|improve this question

edited Mar 20 at 20:02

Daniele Tampieri

2,65221022

asked Mar 20 at 18:20

Steven MinskerSteven Minsker

11

$endgroup$

add a comment | 

$begingroup$

Suppose $k$ is a positive integer: I'm working with the $2k$-nary infix grammar
$$
S to mathrmopd | SSldots S mathrmopr SSldots S,
$$
where there are $k$ $S$s in each side of the $mathrmopr$.

This is a CFG, so the rich theory of CFG's and PDA's applies, and it's also obvious that the grammar is ambiguous as is (without parentheses or precedence rules). But far more simplistically --

I have found a very easy algorithm involving just counting how many $mathrmopd$s are in between pairs of $mathrmopr$s to validate expressions in the language and which provides a parse for valid expressions.

Is this result new and/or interesting?

context-free-grammar

share|cite|improve this question

edited Mar 20 at 20:02

Daniele Tampieri

2,65221022

asked Mar 20 at 18:20

Steven MinskerSteven Minsker

11

$endgroup$

share|cite|improve this question

edited Mar 20 at 20:02

Daniele Tampieri

2,65221022

asked Mar 20 at 18:20

Steven MinskerSteven Minsker

11

share|cite|improve this question

edited Mar 20 at 20:02

Daniele Tampieri

2,65221022

asked Mar 20 at 18:20

Steven MinskerSteven Minsker

11

edited Mar 20 at 20:02

Daniele Tampieri

2,65221022

edited Mar 20 at 20:02

Daniele Tampieri

2,65221022

asked Mar 20 at 18:20

Steven MinskerSteven Minsker

11

asked Mar 20 at 18:20

Steven MinskerSteven Minsker

11