Containment

Boolean implication

Contained Items

Increment by 1 again and we get the T .

I'm just going to show you in the interpreter how this plays out.

Now I'm going to add some debugging to see if I've gotten the right answer.

And if I found more than 1, then I've shown the grammar to be ambiguous.

Pattern that is used for file inclusion

I could do range starting at 1 and including 1 up to but not including 7.

I'm teaching in this class a number of elements of functional programming,

Since 1, 3, and 5 were the odd numbers, 2, 6, and 10 are the multiplication by 2.

File containing list of fonts to print

As you remember, this list was 0, 1, 2, 3, 4 (Did I say 0,1,2,3,4,5 before?

We only wanted to compute this closure on E.

I'm going to show you a third way to make that list that's even more natural than the previous two.

Let's go back to the code.

It's a successful, inclusive experience.

It also can be a recursive definition.

The second list only contains 1, 9, and 25 for the numbers 1, 3, and 5.

One way to do this is to use list comprehensions as we've learned earlier in the class.

So now that I've defined my helper function, I need to use it.

Suppose what I really want is for the output to be the list 1, 2, 3.

Here is a candidate answer.

And we determine that by calling cfgempty on every single symbol.

I'm also going to show you an even easier way to do this.

Remove file containing list of fonts to print

Each element of the main list is a list.

How do we manage this technological change?

I should have said it more precisely. Up to but not INCLUDlNG 8

Path to the file containing the list of available channels

And then we'll briefly go over how to do it with a function declaration.

This is the HTML for a particular post.

It's a list where each element of the list is a list containing a keyword and a list as its second element, and that list is a list of URLs where that keyword appears.

If it is, we bring in the closure, and that's it.

Then we want the output to include the empty list we don't have any of them all of the lists containing just 1 of them, all of the lists containing any pair of them, and then all of them.

It looks like there are many more elements here, but len is only counting the outer elements.

Let's see an example of that.

So 1, 2, 3, 4, 5 should give us 1, 4, 9, 16, 25, and down here in the output it does.

This whole thing is what we want to add so, that's a list containing the value keyword as its 1st element.

The list of library paths already contains this path.

So we're going to take the sum of a

This is the first one, since it wasn't already in an index, so, it will be a list containing just one URL.

Narrator I hope you're getting a sense that lists are very powerful.

We're going to use this idea now to do something a little more clever.

We could create a list using just 2 brackets, a left bracket and a right bracket, and this would create a list containing 0 elements, also known as the empty list.