Much appreciation for these videos, Dr. Califf. My professor now could take some notes. I've never before been so lost following a 3-hour lecture only to feel confident enough for a test 15 minutes later
You've earned a subscriber. Incredible content, well explained, using the right amount of abstraction, good examples, good slides, well organized video. You should have a much bigger crowd for what you create. Thank you for existing (:
wow, very good video! the only point where i missed a programming example was when you were talking about nonterminals at first but being new to this you gave the perfect intro! thank you!
This helped me understand the topic very well, I was really struggling to understand the basics of this in my class. Thank you very much for the video!
Hard to catchup if you're not familiair with certain phrases, but it helps me out understanding less good described study material of the course I'm taking...👍🏻
thank you! you are amazing. this video was one of the easiest to understand. I have a question: is it possible to make a rule for another language that has a different syntax and grammar structure from English? for example in English the determiner which is "the" is in front of the noun: the apple. but in Kurdish the determiner is behind a noun: Sewaka. sew: apple, aka:the. can we set a rule for these type of grammar where a noun is followed by a determiner?
In general, a context free grammar can show some of the simpler constructs of any fixed-word order language (one that relies more on the order of the words than the endings of the words to determine the structure/meaning of an utterance). However, no human language can be fully accurately represented in a context-free grammar. I use some simple English here because it should be familiar to my viewers, but BNF is most useful for representing artificial languages, like programming languages. We need something more complex/sophisticated to handle a human language.
By seeing the example of the , I just remembered I've already seen the problem of that way of doing it, that tuns ambiguous using the parse trees, but how we do an unambiguous BNF of ? I've already seen the explanation of this problem, using the concepts of matched and unmatched sentences, but I did not understand it very well.
Excellent Video. Excellent tutoring. Thank you. (Although I do feel that Panini could have had a mention even if just to illustrate how long people have been thinking about this stuff)
BNF grammars can represent regular, context free, or context sensitive grammars. It's just a different syntax for the grammar that we typically use in theory contexts.
v.nice you earned a subscriber, your video content is incredible, but I was searching for "attribute grammar" in the context of theory of programming language but I did not find
I'm glad you like the content, but attribute grammars are beyond the scope of the classes I currently teach, and I'm still primarily focused on making videos for my current students, though I'm delighted that others find them helpful.
@@maryelainecaliff omg thank you for responding so quickly! Well... I have to define "list" which is an array of positive integers type of variable. In terms of what language....maybe C?
@@anastasiak8724 That's going to be specific to a given language and a specific version of BNF/EBNF. Note that you're actually mixing up BNF syntax with regular expression syntax, and they're not quite the same thing -- though definitely related.
I teach at Illinois State University. Because of modern-day learning management systems and the fact that my slides tend to be somewhat content-light, I do not post them publicly. In class, I'm a big believer in using slides to keep the class organized and ask questions as opposed to using them to convey content, so they would not be very helpful to people who were not sitting in my classroom.
Afraid not. The Califf name is actually my husband's, and it is believed to come from Europe and be a corruption of either Calef or Caleb. No connection to the title or that part of the world.
Much appreciation for these videos, Dr. Califf. My professor now could take some notes. I've never before been so lost following a 3-hour lecture only to feel confident enough for a test 15 minutes later
I'm glad you found the video helpful.
You've earned a subscriber. Incredible content, well explained, using the right amount of abstraction, good examples, good slides, well organized video. You should have a much bigger crowd for what you create. Thank you for existing (:
I appreciate the compliment, and I'm glad you have found the video helpful.
There should be more academics sharing their knowledge online because coding is such an egalitarian field!
Excellent video Ms Califf - very easy to understand and follow. Thanks again!
Glad it was helpful!
Finding well explained computer science content is not that easy. Thanks for makign a students life a little bit easier. You've earn a subscriber.
Great to hear! Glad you found it helpful.
wow, very good video! the only point where i missed a programming example was when you were talking about nonterminals at first but being new to this you gave the perfect intro! thank you!
I'm glad you found it helpful
Excellent video/tutorial! Thanks a lot Dr Califf
Glad you found it helpful.
I just want to say you are amazing and saved my midterm grade :)
Glad to hear it.
This helped me understand the topic very well, I was really struggling to understand the basics of this in my class. Thank you very much for the video!
I'm glad it helped.
very smooth explanation. thanks, Dr.
Glad it was helpful!
Hard to catchup if you're not familiair with certain phrases, but it helps me out understanding less good described study material of the course I'm taking...👍🏻
This was great explanation. Thanks for the video. Subscribed right after!
I'm glad you found it helpful, and hope some of the other videos are as well. I also hope to give you some new content eventually.
Thanks so much for a video. Clear explanation. Love it
I'm glad you found it helpful!
Succinct exposition. Thanks for this valuable content, Dr. Califf.
I'm glad you are finding it helpful.
Very clear explanation and a good presentation! Exactly what I needed to help me grasp the concept of BNF quickly and intuitively
Glad it was helpful!
Great video, very useful information
Thank you! Glad you found it helpful.
thank you! you are amazing. this video was one of the easiest to understand. I have a question: is it possible to make a rule for another language that has a different syntax and grammar structure from English? for example in English the determiner which is "the" is in front of the noun: the apple. but in Kurdish the determiner is behind a noun: Sewaka. sew: apple, aka:the. can we set a rule for these type of grammar where a noun is followed by a determiner?
In general, a context free grammar can show some of the simpler constructs of any fixed-word order language (one that relies more on the order of the words than the endings of the words to determine the structure/meaning of an utterance). However, no human language can be fully accurately represented in a context-free grammar. I use some simple English here because it should be familiar to my viewers, but BNF is most useful for representing artificial languages, like programming languages. We need something more complex/sophisticated to handle a human language.
By seeing the example of the , I just remembered I've already seen the problem of that way of doing it, that tuns ambiguous using the parse trees, but how we do an unambiguous BNF of ? I've already seen the explanation of this problem, using the concepts of matched and unmatched sentences, but I did not understand it very well.
Have you checked out my video on ambiguous grammars?
@@maryelainecaliff Not yet, I'll check it.
Very good Video. Got it all first try :)
I'm glad you found it helpful.
This was amazingly helpful. You gave a nice overview of grammar and how to describe it with BNF. Thank you for video.
Thanks for the compliment. I'm glad you found it helpful.
Great 👍
Can you maybe explain more about how you can write BNF grammar for bitwise expressions.... (Sorry if my questions doesn't make any sense)
Crazy informative thanks a lot!
This was very helpful! Thank you so much!
I'm glad you found it helpful.
Thank you for this useful video.
Glad it was helpful!
Thank yo so much Ma'am, it was just so awesomely explained.
I'm glad you found it helpful.
Mary, you're awesome. Thank you so much!
Very informative. Thanks for the clear and concise explanation :D
You're very welcome. Glad it was helpful.
Glad I found your channel! Thank you!
I'm glad you're finding it helpful.
I wish i could discover this channel earlier...
I appreciate the kind words. I'm glad you're finding it helpful.
Awesome. Easy to understand. Thanks
Glad you found it helpful.
great video! thank you so much!
Glad it was helpful!
Brilliant explanation.
You are very kind.
Excellent Video. Excellent tutoring. Thank you. (Although I do feel that Panini could have had a mention even if just to illustrate how long people have been thinking about this stuff)
Thanks for the compliment.
comprehensive. Thanks.
This was very good explanation, thank you very much
You are welcome! I'm glad you found it helpful.
It is very similar to Context-Free Grammar!
BNF grammars can represent regular, context free, or context sensitive grammars. It's just a different syntax for the grammar that we typically use in theory contexts.
v.nice you earned a subscriber, your video content is incredible, but I was searching for "attribute grammar" in the context of theory of programming language but I did not find
I'm glad you like the content, but attribute grammars are beyond the scope of the classes I currently teach, and I'm still primarily focused on making videos for my current students, though I'm delighted that others find them helpful.
how do we define arrays?
In what sense? In a particular language, or are you looking for a formal definition of an array?
@@maryelainecaliff omg thank you for responding so quickly! Well... I have to define "list" which is an array of positive integers type of variable. In terms of what language....maybe C?
For example i know that defining a positive integer variable (let's say "x") is ::=, but what are the rules about arrays?
@@anastasiak8724 That's going to be specific to a given language and a specific version of BNF/EBNF. Note that you're actually mixing up BNF syntax with regular expression syntax, and they're not quite the same thing -- though definitely related.
Thanks for this!
You're welcome.
Very helpful video! Thank you!
Glad it was helpful!
Where do you teach, Professor? Do you have any website where you upload your lecture slides?
I teach at Illinois State University.
Because of modern-day learning management systems and the fact that my slides tend to be somewhat content-light, I do not post them publicly. In class, I'm a big believer in using slides to keep the class organized and ask questions as opposed to using them to convey content, so they would not be very helpful to people who were not sitting in my classroom.
Mam you are amazing......
Thank you? I'm glad you find the video useful.
@maryelainecaliff yes mam it was very useful. Have you even explained reduction ad absurdum theorem? It's very confusing..
Thank you so much!
Thank you!
Thanks!
Welcome! Glad you found it helpful.
Thank you
Glad you found it helpful.
Thank you)
You're awesome
Thank you.
thank you mom
You are welcome. Glad you found it helpful.
Maybe your grand grand grandfather has been a Khalif?
Afraid not. The Califf name is actually my husband's, and it is believed to come from Europe and be a corruption of either Calef or Caleb. No connection to the title or that part of the world.
I'm learning about BNF in class, currently. I didn't know the creator of 4Chan was also the creator of BNF. The more you know.
Didn't Chris Poole create 4chan?
słabe niestety eh duzo szczekania malo robienia
I hate BNF.
I'm sorry to hear that. It's a useful formalism.
thank you
Thank you
thank you!