On Apr 17, 11:43 pm, Steven D'Aprano wrote:
>
> You won't gain that from the *grammar* of the language. Grammar is only part
> of the story, and in some ways, the least important part. If I tell you
> that the grammar of English includes:
>
> ADJECTIVE NOUN
>
> that alone is not going to help you
On Apr 18, 4:40 am, Mark Janssen wrote:
> On Tue, Apr 16, 2013 at 8:55 PM, rusi wrote:
> > Circular just means recursive and recursion is the bedrock for
> > language-design.
>
> Rercursion the "bedrock" of language-design. I don't think so.
Imperative programmers may be forgiven for not unders
Ian於 2013年4月17日星期三UTC+8下午3時21分00秒寫道：
> On Tue, Apr 16, 2013 at 8:57 PM, Bruce McGoveran
>
> wrote:
>
> > These are terms that appear in section 5 (Expressions) of the Python online
> > documentation. I'm having some trouble understanding what, precisely,
> > these terms mean. I'd appreciate
On Wed, Apr 17, 2013 at 8:14 PM, Steven D'Aprano
wrote:
> Incorrect. Early Fortran, which was definitely Turing complete, was
> incapable of using recursion. But that doesn't matter, since any
> recursive algorithm can be re-written as iteration. So long as a language
> can iterate an indefinite n
On Wed, Apr 17, 2013 at 7:04 PM, Mark Janssen wrote:
> On Wed, Apr 17, 2013 at 5:33 PM, Ian Kelly wrote:
>> On Wed, Apr 17, 2013 at 5:40 PM, Mark Janssen
>> wrote:
>>> Rercursion the "bedrock" of language-design. I don't think so. From
>>> what I know, a well-defined language ends at its symb
On Wed, 17 Apr 2013 18:33:09 -0600, Ian Kelly wrote:
> On Wed, Apr 17, 2013 at 5:40 PM, Mark Janssen
> wrote:
>> Rercursion the "bedrock" of language-design. I don't think so. From
>> what I know, a well-defined language ends at its symbols. It makes no
>> use of "infinities".
>
> From what I
On Thu, Apr 18, 2013 at 9:40 AM, Mark Janssen wrote:
> On Tue, Apr 16, 2013 at 8:55 PM, rusi wrote:
>> On Apr 17, 7:57 am, Bruce McGoveran wrote:
>>> 3. Section 5.3.1 offers this definition of an attributeref:
>>> attributeref ::= primary "." identifier
>>>
>>
>> One general comment I will
On 18/04/2013 02:04, Mark Janssen wrote:
On Wed, Apr 17, 2013 at 5:33 PM, Ian Kelly wrote:
On Wed, Apr 17, 2013 at 5:40 PM, Mark Janssen wrote:
Rercursion the "bedrock" of language-design. I don't think so. From
what I know, a well-defined language ends at its symbols. It makes no
use of "
On 18/04/2013 01:41, Mark Janssen wrote:
On Wed, Apr 17, 2013 at 5:29 PM, alex23 wrote:
On Apr 18, 9:40 am, Mark Janssen wrote:
This is what this list (python) has not figured out yet, because they
look up to the theoretical C.S. field and it hasn't yet been
published.
No one here idolises
On Wed, Apr 17, 2013 at 5:33 PM, Ian Kelly wrote:
> On Wed, Apr 17, 2013 at 5:40 PM, Mark Janssen
> wrote:
>> Rercursion the "bedrock" of language-design. I don't think so. From
>> what I know, a well-defined language ends at its symbols. It makes no
>> use of "infinities".
>
> From what I kn
On Wed, Apr 17, 2013 at 5:29 PM, alex23 wrote:
> On Apr 18, 9:40 am, Mark Janssen wrote:
>> This is what this list (python) has not figured out yet, because they
>> look up to the theoretical C.S. field and it hasn't yet been
>> published.
>
> No one here idolises "the theoretical C.S. field". Th
On Wed, Apr 17, 2013 at 5:40 PM, Mark Janssen wrote:
> Rercursion the "bedrock" of language-design. I don't think so. From
> what I know, a well-defined language ends at its symbols. It makes no
> use of "infinities".
>From what I know, you can't have a Turing-complete language without
some fo
On Apr 18, 9:40 am, Mark Janssen wrote:
> This is what this list (python) has not figured out yet, because they
> look up to the theoretical C.S. field and it hasn't yet been
> published.
No one here idolises "the theoretical C.S. field". They *use* Python
to *get things done*, not to engage in p
On Tue, Apr 16, 2013 at 8:55 PM, rusi wrote:
> On Apr 17, 7:57 am, Bruce McGoveran wrote:
>> 3. Section 5.3.1 offers this definition of an attributeref:
>> attributeref ::= primary "." identifier
>>
>
> One general comment I will make is regarding your distress at what you
> call 'circular'
Wow, that's some impressive wall of text! Splitting your comments up into a
few paragraphs would make it much easier to read :-)
My comments below...
On Wed, 17 Apr 2013 10:15:02 -0700, Bruce McGoveran wrote:
> Thank you all for your thoughtful replies. I appreciate your collective
> insight.
Thank you all for your thoughtful replies. I appreciate your collective
insight. I didn't mean to cast the concept of recursion in a negative light -
I'm actually comfortable with the concept, at least to some extent, and I
appreciate the need for its use in this documentation. I also appreci
On Tue, 16 Apr 2013 19:57:25 -0700, Bruce McGoveran wrote:
> These are terms that appear in section 5 (Expressions) of the Python
> online documentation. I'm having some trouble understanding what,
> precisely, these terms mean. I'd appreciate the forum's thoughts on
> these questions:
>
> 1.
On 04/16/2013 10:57 PM, Bruce McGoveran wrote:
These are terms that appear in section 5 (Expressions) of the Python online
documentation. I'm having some trouble understanding what, precisely, these
terms mean. I'd appreciate the forum's thoughts on these questions:
3. Section 5.3.1 offers
On Tue, Apr 16, 2013 at 8:57 PM, Bruce McGoveran
wrote:
> These are terms that appear in section 5 (Expressions) of the Python online
> documentation. I'm having some trouble understanding what, precisely, these
> terms mean. I'd appreciate the forum's thoughts on these questions:
>
> 1. Sect
On Apr 17, 7:57 am, Bruce McGoveran wrote:
> These are terms that appear in section 5 (Expressions) of the Python online
> documentation. I'm having some trouble understanding what, precisely, these
> terms mean. I'd appreciate the forum's thoughts on these questions:
>
> 1. Section 5.2.1 ind
These are terms that appear in section 5 (Expressions) of the Python online
documentation. I'm having some trouble understanding what, precisely, these
terms mean. I'd appreciate the forum's thoughts on these questions:
1. Section 5.2.1 indicates that an identifier occurring as an atom is a n
21 matches
Mail list logo
