<transcript><audio_139>like it just it doesn't allow you to do it the an one parel does doesn't allow you to write this even if you think that this should be python there is more problems like for instance rules in L1 grammars used to be super complicated so they are very difficult to work with and also they don't have something called</transcript><transcript><audio_140>Left recursion so if you have like for instance like a plus b plus C and then you're want to write a rule to WR Express this you will have some rule that start with itself to create this kind of tree over here but unfortunately an L1 parel will will not work with this</transcript><transcript><audio_141>because it will start it has a left Mor derivation so it will start fing expression forever which you know it doesn't work obviously uh so you need to write like something like this which is a bit junky and inrease this this other kind of trees uh that then you need to like pre-process again into an abstract</transcript><transcript><audio_142>syntax tree that you want uh which is like not only more costl memory but also is a slower so so you know a lot of problems here not only related to grammars so we are going to change the parser we are going to introduce PEC parsers so for to understand what the per parer is very simple uh we need to</transcript><caption><image_143>The image is a graphic design of a white rectangular box with the word "rule" written in red and green letters on it. The box is placed on a beige background. On top of the box, there is a white paper with a black and white illustration of a circuit board. The circuit board is divided into four sections, each with a different color - red, green, yellow, and orange. On the right side of the image, there are two smaller images of a person wearing headphones and holding a microphone. The image appears to be a promotional graphic for a music festival or event.</caption> like it just it doesn't allow you to do it the an one parel does doesn't allow you to write this even if you think that this should be python there is more problems like for instance rules in L1 grammars used to be super complicated so they are very difficult to work with and also they don't have something called Left recursion so if you have like for instance like a plus b plus C and then you're want to write a rule to WR Express this you will have some rule that start with itself to create this kind of tree over here but unfortunately an L1 parel will will not work with this because it will start it has a left Mor derivation so it will start fing expression forever which you know it doesn't work obviously uh so you need to write like something like this which is a bit junky and inrease this this other kind of trees uh that then you need to like pre-process again into an abstract syntax tree that you want uh which is like not only more costl memory but also is a slower so so you know a lot of problems here not only related to grammars so we are going to change the parser we are going to introduce PEC parsers so for to understand what the per parer is very simple uh we need to
{"source": "grass-yt-cc-by.0C4eKA5DXFs|shard_10016_22|create_multimodal_data.extract_yt_and_generate_transcripts.62|shard_10016|create_multimodal_data.generate_captions.42|shard_10016|create_multimodal_data.generate_captions.55", "params": {"id": "0C4eKA5DXFs", "channel_id": "UCHLnNgRnfGYDzPCCH8qGbQw", "duration": 4151, "view_count": 107, "age_limit": 0, "like_count": 3, "channel_follower_count": 6170, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@PyConTaiwanVideo", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10016/0C4eKA5DXFs.tar.gz"}}